A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
DOI10.1111/ITOR.12725OpenAlexW2979156264WikidataQ127177652 ScholiaQ127177652MaRDI QIDQ6090469FDOQ6090469
Authors: Ruslán G. Marzo, Celso C. Ribeiro 
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12725
metaheuristicsGRASPpath-relinkingrestartstime-to-target plotsgeneralized minimum spanning tree problemrandomized metaheuristicsprize-collecting generalized minimum spanning tree problem
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Introduction to algorithms.
- Heuristic search for the generalized minimum spanning tree problem
- 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 hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- New models of the generalized minimum spanning tree problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- Hybridization of GRASP metaheuristic with data mining techniques
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
- Restart strategies for GRASP with path-relinking heuristics
- Solving group Steiner problems as Steiner problems.
- On the prize-collecting generalized minimum spanning tree problem
- Steiner’s problem for set-terminals
- A two-level solution approach for solving the generalized minimum spanning tree problem
- A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
- The prize-collecting generalized minimum spanning tree problem
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- A heuristic for the minimum cost chromatic partition problem
Cited In (8)
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- A case study of consistent vehicle routing problem with time windows
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
- An enhanced GRASP approach for the index tracking problem
- Fixed set search applied to the clique partitioning problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
This page was built for publication: A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090469)
