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. © 2009 Elsevier B.V. All rights reserved.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below