Abstract
We introduce a local search strategy that suits combinatorial optimization problems with a min-max (or max-min) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.
Original language | English |
---|---|
Pages (from-to) | 265-279 |
Number of pages | 15 |
Journal | European Journal of Operational Research |
Volume | 151 |
Issue number | 2 |
DOIs | |
State | Published - 1 Dec 2003 |
Keywords
- Facility planning
- Heuristics