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
LIP6 - Laboratoire d'Informatique de Paris 6
2 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01351336
Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 12, 2017 - 12:47:25 PM
Last modification on : Thursday, March 21, 2019 - 1:03:50 PM
Document(s) archivé(s) le : Thursday, January 25, 2018 - 3:11:34 AM

File

fsospp2006.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01351336, version 1

Citation

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⟩

Share

Metrics

Record views

122

Files downloads

79