A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
DOI10.1016/J.COR.2011.11.018zbMATH Open1348.90643OpenAlexW1972011169MaRDI QIDQ336718FDOQ336718
Authors: Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. 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
Recommendations
- Experiments with LAGRASP heuristic for set \(k\)-covering
- scientific article; zbMATH DE number 4121754
- Simple Lagrangian heuristic for the set covering problem
- A heuristic algorithm for the set covering problem
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
metaheuristicslocal searchhybrid heuristicsset coveringGRASPLagrangean relaxationLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Extremal set theory (05D05)
Cites Work
- Approximation algorithms for combinatorial problems
- A Greedy Heuristic for the Set-Covering Problem
- Validation of subgradient optimization
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- GRASP: An annoted bibliography
- Title not available (Why is that?)
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- An algorithm for set covering problem
- TTT plots: a perl program to create time-to-target plots
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Heuristic Method for the Set Covering 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
- The multicovering problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Heuristic solutions and confidence intervals for the multicovering problem
Cited In (14)
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Decomposition based hybrid metaheuristics
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
- Experiments with LAGRASP heuristic for set \(k\)-covering
- An improved configuration checking-based algorithm for the unicost set covering problem
- Hyperbolic set covering problems with competing ground-set elements
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Probabilistic stopping rules for GRASP heuristics and extensions
Uses Software
This page was built for publication: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336718)
