A multigraph formulation for the generalized minimum spanning tree problem

DOI10.1007/978-3-319-96151-4_12zbMATH Open1404.90132OpenAlexW2884506256MaRDI QIDQ1661871FDOQ1661871

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

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

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)

Cited In (3)

• Title not available (Why is that?)
• 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

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)