|
|||||
|
|
Bound sets for biobjective combinatorial optimization problems |
|
| Authors: | Matthias Ehrgott Xavier Gandibleux |
| Affiliation: | 1. Department of Engineering Science, University of Auckland, Private Bag 92019, Auckland, New Zealand;2. LINA – FRE CNRS 2729, Université de Nantes, 2, Rue de la Houssinière BP 92208, F-44322 Nantes Cedex 03, France |
| Abstract: | In this paper we introduce the concept of bound sets for multiobjective discrete optimization. We prove general results on lower and upper bound sets for combinatorial optimization problems with multiple objectives. We present general algorithms for constructing lower and upper bound sets for biobjective problems and provide numerical results on five different problem types. |
| Keywords: | Multiobjective discrete optimization Lower bound Upper bound Heuristics Relaxation |
| 本文献已被 ScienceDirect 等数据库收录！ | |