Title of article
Bound sets for biobjective combinatorial optimization problems
Author/Authors
Matthias Ehrgott، نويسنده , , Xavier Gandibleux، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2007
Pages
21
From page
2674
To page
2694
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
Journal title
Computers and Operations Research
Serial Year
2007
Journal title
Computers and Operations Research
Record number
928487
Link To Document