A tabu search heuristic for the generalized minimum spanning tree problem
From MaRDI portal
Publication:933503
DOI10.1016/j.ejor.2007.08.021zbMath1149.90068MaRDI QIDQ933503
Gilbert 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
90B40: Search theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- The Steiner tree problem
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Solving group Steiner problems as Steiner problems.
- Generalized spanning trees
- Future paths for integer programming and links to artificial intelligence
- On the prize-collecting generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Heuristic Search for the Generalized Minimum Spanning Tree Problem
- TSPLIB—A Traveling Salesman Problem Library
- Parallel iterative search methods for vehicle routing problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- 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
- On the generalized minimum spanning tree problem
