Bound sets for biobjective combinatorial optimization problems
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.
multiobjective discrete optimization upper bound lower bound heuristics relaxation