Re-Aggregation Heuristics for the Large Location Problems with Lexicographic Minimax Objective
We propose a new heuristic algorithm that provides solutions to the discrete lexicographic minimax location problem. The algorithm is applicable to large instances of the problem. The lexicographic minimax location problem is known to be NP-hard. Therefore, the large instances of the problem are not...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2015-05-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-201502-0001_re-aggregation-heuristics-for-the-large-location-problems-with-lexicographic-minimax-objective.php |