Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem

DOI10.1007/978-3-642-21527-8_6zbMath1345.90101OpenAlexW53087745MaRDI QIDQ3091481

No author found.

Publication date: 9 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_6

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem