A tabu search heuristic for the generalized minimum spanning tree problem
From MaRDI portal
Recommendations
- On the generalized minimum spanning tree problem
- Heuristic search for the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 5036665
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2037815 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Future paths for integer programming and links to artificial intelligence
- Generalized spanning trees
- Heuristic search for the generalized minimum spanning tree problem
- Network flows. Theory, algorithms, and applications.
- On the generalized minimum spanning tree problem
- On the prize-collecting generalized minimum spanning tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Parallel iterative search methods for vehicle routing problems
- Solving group Steiner problems as Steiner problems.
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- TSPLIB—A Traveling Salesman Problem Library
- The Steiner tree problem
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
Cited in
(16)- scientific article; zbMATH DE number 5036665 (Why is no real title available?)
- Strategyproof auction mechanisms for network procurement
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- A two-level metaheuristic for the all colors shortest path problem
- A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
- Approximation algorithms for generalized MST and TSP in grid clusters
- A rapid learning automata-based approach for generalized minimum spanning tree problem
- 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
- A two-level solution approach for solving 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
- Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Heuristic search for the generalized minimum spanning tree problem
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
This page was built for publication: A tabu search heuristic 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 Q933503)
