Flow-based formulation for the maximum leaf spanning tree problem
References (11)
An exact algorithm for the maximum leaf spanning tree problem
Computers & Operations Research
(2003)- et al.
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
(1998) Constructing full spanning trees for cubic graphs
Information Processing Letters
(1981)- et al.
Solving the connected dominating set problem and power dominating set problem by integer programming
The maximum-leaf spanning tree problem: Formulations and facets
Networks
(2004)
There are more references available in the full text version of this article.
Cited by (7)
Spanning trees with a constraint on the number of leaves. A new formulation
2017, Computers and Operations ResearchCitation Excerpt :With respect to the MCDSP, this algorithm is the fastest proposed in the literature. Recently, Reis and Usberti [14] proposed a flow-based mixed-integer linear programming model. The model produces a weak LP bound.
A new formulation and algorithm for the maximum leaf spanning tree problem with an application in forest fire detection
2023, Engineering OptimizationA Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
2022, INFORMS Journal on ComputingOptimization of wireless sensor networks deployment with coverage and connectivity constraints
2021, Annals of Operations ResearchInstance Generation Framework for Green Vehicle Routing
2021, AIRO Springer SeriesLayout design of parking lots with mathematical programming
2021, Transportation Science
- 1
This research was supported by CAPES and CNPq (Proc. 303947/2008-0, 477692/2012-5 and 483137/2013-8).
Copyright © 2015 Elsevier B.V. All rights reserved.