Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem

DOI10.1016/j.ejor.2015.05.001zbMath1346.90725OpenAlexW1881547188MaRDI QIDQ319778

Luidi Simonetti, Abilio Lucena, Alexandre Salles da Cunha

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.001

zbMATH Keywords

combinatorial optimizationoptimality cutsbranch-and-cut\(k\)-rooted mini-max spanning forest problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• Partitioning procedures for solving mixed-variables programming problems
• A heuristic algorithm for the mini-max spanning forest problem
• A branch-and-bound algorithm for the mini-max spanning forest problem
• Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem
• Improved algorithms for the Steiner problem in networks

This page was built for publication: Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem