Flow-based formulation for the maximum leaf spanning tree problem

https://doi.org/10.1016/j.endm.2015.07.035Get rights and content

Abstract

The maximum leaf spanning tree problem consists in finding a spanning tree of a given graph G with the maximum number of leaves. In this work we propose a flow-based mixed-integer linear programming model for this problem. Computational experiments are executed in two sets of instances from the literature. The results show that the model is competitive with alternative exact approaches.

References (11)

There are more references available in the full text version of this article.

Cited by (7)

View all citing articles on Scopus
1

This research was supported by CAPES and CNPq (Proc. 303947/2008-0, 477692/2012-5 and 483137/2013-8).

View full text