Restart strategies for GRASP with path-relinking heuristics
From MaRDI portal
Publication:691439
DOI10.1007/S11590-011-0322-2zbMATH Open1259.90114OpenAlexW2074887624MaRDI QIDQ691439FDOQ691439
Authors: Mauricio G. C. Resende, Celso C. Ribeiro 
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0322-2
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Fundamentals of scatter search and path relinking
- GRASP: An annoted bibliography
- Title not available (Why is that?)
- Handbook of metaheuristics
- Optimal speedup of Las Vegas algorithms
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- Handbook of metaheuristics
- Title not available (Why is that?)
- An advanced tabu search algorithm for the job shop problem
- GRASP with path relinking heuristics for the antibandwidth problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP with path relinking for the weighted MAXSAT problem
- Randomized heuristics for the Max-Cut problem
- A GRASP with path-relinking for private virtual circuit routing
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- Restart strategies in optimization: parallel and serial cases
- Optimization parallelizing for discrete programming problems
- On algorithm portfolios and restart strategies
Cited In (7)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- An enhanced GRASP approach for the index tracking problem
- Extending time-to-target plots to multiple instances
- Optimal configuration of power distribution networks with variable renewable energy resources
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- A simple greedy heuristic for linear assignment interdiction
Uses Software
This page was built for publication: Restart strategies for GRASP with path-relinking heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691439)
