A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Year of publication: |
May 2017
|
---|---|
Authors: | Silvestri, Selene ; Laporte, Gilbert ; Cerulli, Raffaele |
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. 81.2017, p. 322-332
|
Subject: | Spanning tree | Branch vertices | Branch-and-cut | Vertikale Integration | Vertical integration | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
MarĂn, Alfredo, (2015)
-
Leitner, Markus, (2016)
- More ...
-
Collaborative Prepositioning Network Design for Regional Disaster Response
Balcik, Burcu, (2019)
-
Optimizing access to drinking water in remote areas : application to Nepal
Laporte, Gilbert, (2022)
-
Lower and upper bounds for the spanning tree with minimum branch vertices
Carrabs, Francesco, (2013)
- More ...