A multigraph formulation for the generalized minimum spanning tree problem

DOI10.1007/978-3-319-96151-4_12MaRDI QIDQ1661871zbMATH OpenOpenAlexFDO

Authors Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_12

zbMATH Keywords

generalized minimum spanning treemixed integer linear programming formulationstrees of multigraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• New models of the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5621997
• Relaxation methods for the Generalized Minimum Spanning Tree problem
• On the generalized minimum spanning tree problem
• The generalized minimum spanning tree: polyhedra and branch-and-cut

Cited in

(3)

• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• scientific article; zbMATH DE number 5621997 (Why is no real title available?)

This page was built for publication: A multigraph formulation for the generalized minimum spanning tree problem

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