Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
Year of publication: |
2015
|
---|---|
Authors: | Marín, Alfredo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 245.2015, 3 (16.9.), p. 680-689
|
Subject: | Integer programming | Spanning tree | Branch vertices | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Vertikale Integration | Vertical integration | Graphentheorie | Graph theory |
-
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Silvestri, Selene, (2017)
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
Locating names on vertices of a transaction network
Alcaide-López-de-Pablo, David, (2017)
- More ...
-
The discrete facility location problem with balanced allocation of customers
Marín, Alfredo, (2011)
-
An extended covering model for flexible discrete and equity location problems
Marín, Alfredo, (2010)
-
An extended covering model for flexible discrete and equity location problems
Marín, Alfredo, (2010)
- More ...