Formulations and branch-and-cut algorithm for the k-rooted mini-max spanning forest problem

Authors:
Alexandre Salles Da Cunha;Luidi Simonetti;Abilio Lucena
Affiliations:
Universidade Federal de Minas Gerais, Departamento de Ciência da Computação;Universidade Federal Fluminense, Instituto de Computação;Universidade Federal do Rio de Janeiro, Programa de Engenharia de Sistemas e Computação
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 3
Cited 0

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
The Steiner tree polytope and related polyhedra

Mathematical Programming: Series A and B
The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach

Computers and Industrial Engineering - Supply chain management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss two Integer Programming Formulations for the K-rooted Mini-max Spanning Forest Problem. In the first, connectivity is reinforced through Generalized Subtour Breaking inequalities while the second uses Directed cutset constraints. We implement a Branch-and-cut method based on the first formulation that also computes combinatorial lower bounds from the literature and implements a Linear Programming based multi-start heuristic. Our computational results suggest that the Linear Programming lower bounds compare favorably to combinatorial lower bounds. Instances generated as suggested in the literature were solved easily by the algorithms proposed in this study.