Relaxation methods for the Generalized Minimum Spanning Tree problem
From MaRDI portal
Recommendations
- New models of the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 5621997
- On the generalized minimum spanning tree problem
- A Lagrangian relaxation approach to the generalized minimum spanning tree problem
Cited in
(18)- Generalized spanning trees
- A multigraph formulation for the generalized minimum spanning tree problem
- A two-level solution approach for solving the generalized minimum spanning tree problem
- Generalized network design problems.
- The prize-collecting generalized minimum spanning tree problem
- On the prize-collecting generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- scientific article; zbMATH DE number 1788251 (Why is no real title available?)
- On the generalized minimum spanning tree problem
- Network optimization on partitioned pairs of points
- A Lagrangian relaxation approach to the generalized minimum spanning tree problem
- An approximation algorithm for the least version of the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- On generalized minimum spanning trees
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
This page was built for publication: Relaxation methods 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 Q2816036)
