scientific article; zbMATH DE number 5621997
From MaRDI portal
Publication:3638643
Recommendations
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- A multigraph formulation for the generalized minimum spanning tree problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- On the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 1788251
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 2037815
Cited in
(11)- At least version of the generalized minimum spanning tree problem
- A multigraph formulation for the generalized minimum spanning tree problem
- Selective generalized travelling salesman problem
- Generalized minimum spanning tree games
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Relaxation methods for the Generalized Minimum Spanning Tree problem
- Vertex covering with capacitated trees
- Integer programming formulations for minimum spanning forests and connected components in sparse graphs
- A two-level solution approach for solving the generalized minimum spanning tree problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638643)
