Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Year of publication: |
July 2017
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Sinnl, Markus |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 83.2017, p. 13-27
|
Subject: | Spanning tree problems | Integer programming | Lagrangian relaxation | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Benchetrit, Yohann, (2018)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
-
An exact solution framework for the multiple gradual cover location problem
Álvarez-Miranda, Eduardo, (2019)
- More ...