Improving on branch-and-cut algorithms for generalized minimum spanning trees

zbMATH Open1274.90453MaRDI QIDQ3368660FDOQ3368660

Authors: Corinne Feremans, Andrea Lodi, Paolo Toth, Andrea Tramontani 

Publication date: 8 February 2006

Recommendations

• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• The generalized minimum spanning tree: polyhedra and branch-and-cut
• New models of the generalized minimum spanning tree problem
• Relaxation methods for the Generalized Minimum Spanning Tree problem
• On the generalized minimum spanning tree problem

Mathematics Subject Classification ID

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

Cited In (4)

• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Upgrading min-max spanning tree problem under various cost functions
• Title not available (Why is that?)

This page was built for publication: Improving on branch-and-cut algorithms for generalized minimum spanning trees

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