Abstract / Description of output
In this paper we introduce flexible models for capacitated discrete location problems. We describe three different points of view of a location problem in a logistics system. Different mathematical programming formulations are presented, illustrated by examples and compared using a battery of test problems. Extensive computational tests are done showing the potentials and limits of this kind of resolution approach.
Keywords / Materials (for Non-textual outputs)
- (B) Location
- Mixed integer programming
- Strategic planning