Facility siting and integer-friendly programming

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 and bounding. Additionally, when multi-objective zero-one programming problems 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.