A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
DOI10.1016/j.cor.2011.11.018zbMath1348.90643OpenAlexW1972011169MaRDI QIDQ336718
Mauricio G. C. Resende, Luciana S. Pessoa, Celso Carneiro Ribeiro
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.018
metaheuristicsLagrangean relaxationGRASPlocal searchset coveringhybrid heuristicsLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Extremal set theory (05D05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic solutions and confidence intervals for the multicovering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- The multicovering problem
- Approximation algorithms for combinatorial problems
- Greedy randomized adaptive search procedures
- An algorithm for set covering problem
- TTT plots: a perl program to create time-to-target plots
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- A Greedy Heuristic for the Set-Covering Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Validation of subgradient optimization
- A Heuristic Method for the Set Covering Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II