search query: @indexterm linear programming / total: 544
reference: 100 / 544
« previous | next »
Author:ReVelle, C.
Title:Facility siting and integer-friendly programming
Journal:European Journal of Operational Research
1993 : MAR 12, VOL. 65:2, p. 147-158
Index terms:LINEAR PROGRAMMING
INTEGER PROGRAMMING
BRANCH AND BOUND METHODS
Language:eng
Abstract: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 record nr: 109007
add to basket
« previous | next »
SCIMA