An exact method to generate all nondominated spanning trees
Year of publication: |
October-December 2016
|
---|---|
Authors: | Boumesbah, Asma ; Chergui, Mohamed El-Amine |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 4/5, p. 857-867
|
Subject: | Minimum spanning tree | integer linear programming | multiple objective linear optimization | combinatorial optimization | branch and bound method | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Operations Research | Operations research | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
The Ordered Median Tree Location Problem
Pozo, Miguel A., (2024)
- More ...
-
A branch-and-cut technique to solve multiobjective integer quadratic programming problems
Ouaïl, Fatma Zohra, (2018)
-
Optimizing a linear function over an efficient set
Belkhiri, Hadjer, (2022)
- More ...