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 | Graphentheorie | Graph theory | Heuristik | Heuristics | Vertikale Integration | Vertical integration | Ganzzahlige Optimierung | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
Dias, Fabio C. S., (2017)
- More ...
-
Extreme points of discrete location polyhedra
Cánovas, Lázaro, (2001)
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
-
Closest assignment constraints in discrete location problems
Espejo, Inmaculada, (2012)
- More ...