Spanning trees with a constraint on the number of leaves. A new formulation
Year of publication: |
May 2017
|
---|---|
Authors: | Gouveia, Luis ; Simonetti, Luidi |
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. 257-268
|
Subject: | Spanning trees | Max-leaves | ILP reformulations | Combinatorial optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem
Fernández, Elena, (2017)
-
Relations, models and a memetic approach for three degree-dependent spanning tree problems
Cerrone, Carmine, (2014)
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain, (2015)
- More ...
-
Clímaco, Glaubos, (2018)
-
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio, (2010)
-
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Cunha, Alexandre Salles da, (2015)
- More ...