A tabu search heuristic for the generalized minimum spanning tree problem
From MaRDI portal
Publication:933503
DOI10.1016/J.EJOR.2007.08.021zbMATH Open1149.90068OpenAlexW2017602820MaRDI QIDQ933503FDOQ933503
G. Laporte, Jean-François Cordeau, Temel Öncan
Publication date: 21 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.021
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
- Title not available (Why is that?)
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Heuristic search for the generalized minimum spanning tree problem
- The Steiner tree problem
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Generalized spanning trees
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- On the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- Parallel iterative search methods for vehicle routing problems
- Title not available (Why is that?)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Title not available (Why is that?)
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- Solving group Steiner problems as Steiner problems.
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- On the prize-collecting generalized minimum spanning tree problem
Cited In (14)
- Title not available (Why is that?)
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- Strategyproof auction mechanisms for network procurement
- A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
- A two-level metaheuristic for the all colors shortest path problem
- 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
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
Uses Software
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)
