On generalized minimum spanning trees

DOI10.1016/S0377-2217(00)00267-8MaRDI QIDQ5945860zbMATH OpenOpenAlexFDO

Authors Corinne Feremans, Martine Labbé, G. 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

zbMATH Keywords

integer linear programming

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35)

Recommendations

• On the generalized minimum spanning tree problem
• New models of the generalized minimum spanning tree problem
• Relaxation methods for the Generalized Minimum Spanning Tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• At least version of the generalized minimum spanning tree problem

Cites work

• Generalized spanning trees
• On the generalized minimum spanning tree problem
• The symmetric generalized traveling salesman polytope

Cited in

(23)

• A two-level solution approach for solving the generalized minimum spanning tree problem
• Generalized network design problems.
• On minimum leaf spanning trees and a criticality notion
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The prize-collecting generalized minimum spanning tree problem
• On the prize-collecting generalized minimum spanning tree problem
• A note on relatives to the Held and Karp 1-tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
• 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
• On recursive computation of minimum spanning trees for special partial graphs
• scientific article; zbMATH DE number 3974972 (Why is no real title available?)
• scientific article; zbMATH DE number 2037815 (Why is no real title available?)
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• scientific article; zbMATH DE number 1512690 (Why is no real title available?)
• scientific article; zbMATH DE number 2201897 (Why is no real title available?)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
• Locating active sensors on traffic networks
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• On the minimum corridor connection problem and other generalized geometric problems
• The geometric generalized minimum spanning tree problem with grid clustering
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

This page was built for publication: On generalized minimum spanning trees

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