Bound sets for biobjective combinatorial optimization problems

Matthias Ehrgott (1) , Xavier Gandibleux (2)

1 Department of Engineering Science
2 LINA - Laboratoire d'Informatique de Nantes Atlantique

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.

Mots clés: Upper bound; Heuristics; Relaxation; Multiobjective discrete optimization; Lower bound

Domaines: Recherche opérationnelle [math.OC]

Matthias Ehrgott, Xavier Gandibleux. Bound sets for biobjective combinatorial optimization problems. Computers and Operations Research, 2007, 34 (9), pp.2674 - 2694. ⟨10.1016/j.cor.2005.10.003⟩. ⟨hal-00462004⟩