New models of the generalized minimum spanning tree problem
From MaRDI portal
Publication:702364
DOI10.1023/B:JMMA.0000036579.83218.8DzbMATH Open1084.90045OpenAlexW2078336410MaRDI QIDQ702364FDOQ702364
Authors: Petrica Pop 
Publication date: 17 January 2005
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jmma.0000036579.83218.8d
Recommendations
- A new relaxation method for the generalized minimum spanning tree problem
- On the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 1788251
- A note on the complexity of the generalized minimum spanning tree problem
- On some polynomial solvable cases of the generalized minimum spanning tree problem
Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cited In (35)
- Generalized Steiner problems and other variants
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- On the prize-collecting generalized minimum spanning tree problem
- An efficient mixed integer linear programming model for the minimum spanning tree problem
- Approximation algorithms for generalized MST and TSP in grid clusters
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- A Lagrangian relaxation approach to the generalized minimum spanning tree problem
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- 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
- Generalized network design problems. Modeling and optimization.
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- A multigraph formulation for the generalized minimum spanning tree problem
- Generalized spanning trees
- On generalized minimum spanning trees
- Network optimization on partitioned pairs of points
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- An approximation algorithm for the least version of the generalized minimum spanning tree problem
- On some polynomial solvable cases of the generalized minimum spanning tree problem
- Solving the generalized minimum spanning tree problem with simulated annealing
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- A note on the complexity of the generalized minimum spanning tree problem
- At least version of the generalized minimum spanning tree problem
- Selective generalized travelling salesman problem
- Title not available (Why is that?)
- A polyhedral approach to the generalized minimum labeling spanning tree problem
- The prize-collecting generalized minimum spanning tree problem
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- Relaxation methods for the Generalized Minimum Spanning Tree problem
This page was built for publication: New models of 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 Q702364)
