A multiobjective branch-and-bound framework : application to the biobjective spanning tree problem
Year of publication: |
2008
|
---|---|
Authors: | Sourd, Francis ; Spanjaard, Olivier |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 20.2008, 3, p. 472-484
|
Subject: | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
Galand, Lucie, (2010)
-
An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
Sousa, Ernando Gomes de, (2015)
-
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Galand, Lucie, (2012)
- More ...
-
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
Sourd, Francis, (2008)
-
Some tractable instances of interval data minmax regret problems
Escoffier, Bruno, (2008)
-
A branch and bound algorithm for choquet optimization in multicriteria problems
Galand, Lucie, (2010)
- More ...