A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
From MaRDI portal
Publication:4601628
DOI10.1111/itor.12419zbMath1386.90126OpenAlexW2735006321MaRDI QIDQ4601628
Ruben Interian, Celso Carneiro Ribeiro
Publication date: 24 January 2018
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12419
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ Improving a constructive heuristic for the general routing problem ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
This page was built for publication: A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
