Multi-objective branch and bound. Application to the bi-objective spanning tree problem

Francis Sourd (1) , Olivier Spanjaard (2) , Patrice Perny (2)

1 RO - Recherche Opérationnelle
2 DECISION

In this work, we give a formal framework to design multiobjective branch-and-bound procedures, and we provide a generalization of the lower bounding concept, able to more tightly bound the Pareto front of a sub-problem. We tested our approach on the bi-objective spanning tree problem. It significantly improves the existing results for the problem.

Domaines: Informatique [cs]

Francis Sourd, Olivier Spanjaard, Patrice Perny. Multi-objective branch and bound. Application to the bi-objective spanning tree problem. 7th International Conference in Multi-Objective Programming and Goal Programming, Jun 2006, Tours, France. ⟨hal-01351336⟩