Closest assignment constraints in discrete location problems

Closest assignment constraints in discrete location problems

0.00 Avg rating0 Votes
Article ID: iaor20121853
Volume: 219
Issue: 1
Start Page Number: 49
End Page Number: 58
Publication Date: May 2012
Journal: European Journal of Operational Research
Authors: , ,
Keywords: combinatorial optimization, programming: integer, programming: linear, programming: assignment
Abstract:

The objective of this paper is to identify the most promising sets of closest assignment constraints in the literature of Discrete Location Theory, helping the authors in the field to model their problems when clients must be assigned to the closest plant inside an Integer Programming formulation. In particular, constraints leading to weak Linear Programming relaxations should be avoided if no other good property supports their use. We also propose a new set of constraints with good theoretical properties.

Reviews

Required fields are marked *. Your email address will not be published.