Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Year of publication: |
2015
|
---|---|
Authors: | Cunha, Alexandre Salles da ; Simonetti, Luidi ; Lucena, Abílio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 246.2015, 2 (16.10.), p. 392-399
|
Subject: | Combinatorial optimization | Branch-and-cut | K-rooted mini-max spanning forest problem | Optimality cuts | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Forstwirtschaft | Forestry | Ganzzahlige Optimierung | Integer programming |
-
Maximum weighted induced forests and trees : new formulations and a computational comparative review
Melo, Rafael A., (2022)
-
A branch-and-cut algorithm for the connected max-k-cut problem
Healy, Patrick, (2024)
-
Silva, Allyson, (2021)
- More ...
-
Gendron, Bernard, (2014)
-
Exact solution algorithms for the chordless cycle problem
Pereira, Dilson Lucas, (2022)
-
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio, (2010)
- More ...