Flow-based formulation for the maximum leaf spanning tree problem

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.