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

DOI10.1016/J.EJOR.2015.05.001zbMATH Open1346.90725OpenAlexW1881547188MaRDI QIDQ319778FDOQ319778

Authors: Alexandre Salles da Cunha, L. Simonetti, Abilio Lucena 

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

Recommendations

• Formulations and branch-and-cut algorithm for the \(K\)-rooted mini-max spanning forest problem
• A branch-and-bound algorithm for the mini-max spanning forest problem
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• A heuristic algorithm for the mini-max spanning forest problem
• A branch and cut method for the degree-constrained minimum spanning tree problem
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

zbMATH Keywords

combinatorial optimizationbranch-and-cut\(k\)-rooted mini-max spanning forest problemoptimality cuts

Mathematics Subject Classification ID

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

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• 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

Cited In (3)

• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• Formulations and branch-and-cut algorithm for the \(K\)-rooted mini-max spanning forest problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319778)