Experiments with LAGRASP heuristic for set \(k\)-covering
From MaRDI portal
Publication:691433
DOI10.1007/s11590-011-0312-4zbMath1259.90113OpenAlexW1968709147MaRDI QIDQ691433
Luciana S. Pessoa, Mauricio G. C. Resende, Celso Carneiro 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
metaheuristicsLagrangean relaxationGRASPlocal searchset coveringhybrid heuristicsLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
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
Cites Work
- Unnamed Item
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Computational experience with general cutting planes for the set covering problem
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- The multicovering problem
- Greedy randomized adaptive search procedures
- An algorithm for 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
This page was built for publication: Experiments with LAGRASP heuristic for set \(k\)-covering