| Article ID: | iaor20083429 |
| Country: | United Kingdom |
| Volume: | 34 |
| Issue: | 9 |
| Start Page Number: | 2674 |
| End Page Number: | 2694 |
| Publication Date: | Sep 2007 |
| Journal: | Computers and Operations Research |
| Authors: | Gandibleux Xavier, Ehrgott Matthias |
| Keywords: | heuristics, sets, combinatorial optimization |
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.