haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 100 / 544
| Tekijä: | ReVelle, C. |
| Otsikko: | Facility siting and integer-friendly programming |
| Lehti: | European Journal of Operational Research
1993 : MAR 12, VOL. 65:2, p. 147-158 |
| Asiasana: | LINEAR PROGRAMMING INTEGER PROGRAMMING BRANCH AND BOUND METHODS |
| Kieli: | eng |
| Tiivistelmä: | Facility siting on networks has been accomplished with some success via integer linear programming formulations of a particular character. Specifically, "constraint expansion" often brings about zero-one solutions with little or no branching or bounding. Additionally, when multi-objective zero-one programming require solution, the weighting method may often be employed with some success. Examples of constraint-expanded and multi-objective problems from facility siting and from other settings are analyzed for common features. |
SCIMA