On the generalized minimum spanning tree problem
From MaRDI portal
Recommendations
Cited in
(71)- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- A comprehensive survey on the generalized traveling salesman problem
- The multicolored graph realization problem
- Generalized Steiner problems and other variants
- scientific article; zbMATH DE number 5036665 (Why is no real title available?)
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- A two-level metaheuristic for the all colors shortest path problem
- General variable neighborhood search approach to group Steiner tree problem
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- On the prize-collecting generalized minimum spanning tree problem
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- Approximation algorithms for generalized MST and TSP in grid clusters
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- Generalized minimum spanning tree games
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- 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 note on relatives to the Held and Karp 1-tree problem
- A Lagrangian relaxation approach to the generalized minimum spanning tree problem
- Vertex covering with capacitated trees
- A rapid learning automata-based approach for generalized minimum spanning tree problem
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- scientific article; zbMATH DE number 5876375 (Why is no real title available?)
- scientific article; zbMATH DE number 2037815 (Why is no real title available?)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Looking for edge-equitable spanning trees
- 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
- The geometric generalized minimum spanning tree problem with grid clustering
- Generalized network design problems. Modeling and optimization.
- Approximation algorithms for group prize-collecting and location-routing problems
- A two-level solution approach for solving the generalized minimum spanning tree problem
- The minimum spanning tree problem with non-terminal set
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- A multigraph formulation for the generalized minimum spanning tree problem
- Upgrading min-max spanning tree problem under various cost functions
- New models of the generalized minimum spanning tree problem
- Generalized spanning trees
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- Competition between Dandelion and Prüfer encoded genetic algorithms for solving the clustered minimum routing tree problem
- On generalized minimum spanning trees
- A tabu search heuristic for the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Network optimization on partitioned pairs of points
- Continuous approximation formulas for location problems
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- Heuristic search for the generalized minimum spanning tree problem
- Approximation theory in combinatorial optimization. Application to 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
- scientific article; zbMATH DE number 3974972 (Why is no real title available?)
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- Solving the generalized minimum spanning tree problem with simulated annealing
- A note on the complexity of the generalized minimum spanning tree problem
- At least version of the generalized minimum spanning tree problem
- An axiomatic approach in minimum cost spanning tree problems with groups
- A survey on Benders decomposition applied to fixed-charge network design problems
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Generalized network design problems.
- scientific article; zbMATH DE number 2201897 (Why is no real title available?)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 1788251 (Why is no real title available?)
- The prize-collecting generalized minimum spanning tree problem
- 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
- Generalized network design polyhedra
This page was built for publication: On 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 Q4894860)
