Experiments with LAGRASP heuristic for set k-covering
DOI10.1007/S11590-011-0312-4zbMATH Open1259.90113OpenAlexW1968709147MaRDI QIDQ691433FDOQ691433
Authors: Luciana S. Pessoa, 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-0312-4
Recommendations
metaheuristicslocal searchhybrid heuristicsset coveringGRASPLagrangean relaxationLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Validation of subgradient optimization
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Greedy randomized adaptive search procedures
- An algorithm for set covering problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Title not available (Why is that?)
- Computational experience with general cutting planes for the set covering problem
- The multicovering problem
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
Cited In (5)
- Simple Lagrangian heuristic for the set covering problem
- Title not available (Why is that?)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- MLQCC: an improved local search algorithm for the set k‐covering problem
Uses Software
This page was built for publication: Experiments with LAGRASP heuristic for set \(k\)-covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691433)
