On generalized minimum spanning trees
From MaRDI portal
Publication:5945860
DOI10.1016/S0377-2217(00)00267-8zbMath0990.90120OpenAlexW2151339549MaRDI QIDQ5945860
Corinne Feremans, Martine Labbé, Gilbert Laporte
Publication date: 14 October 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00267-8
Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35)
Related Items (16)
On the minimum corridor connection problem and other generalized geometric problems ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ The geometric generalized minimum spanning tree problem with grid clustering ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ On the prize-collecting generalized minimum spanning tree problem ⋮ The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Generalized network design problems. ⋮ The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm ⋮ A new relaxation method for the generalized minimum spanning tree problem ⋮ Locating active sensors on traffic networks ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem
Cites Work
This page was built for publication: On generalized minimum spanning trees
