Experiments with LAGRASP heuristic for set k-covering

DOI10.1007/S11590-011-0312-4MaRDI QIDQ691433zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metaheuristicslocal searchhybrid heuristicsset coveringGRASPLagrangean relaxationLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
• A heuristic algorithm for the set covering problem
• scientific article; zbMATH DE number 4121754
• Simple Lagrangian heuristic for the set covering problem
• A Heuristic Method for the Set Covering Problem

Cites work

• scientific article; zbMATH DE number 4121754 (Why is no real title available?)
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
• An algorithm for set covering problem
• Computational experience with general cutting planes for the set covering problem
• Greedy randomized adaptive search procedures
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The multicovering problem
• The traveling-salesman problem and minimum spanning trees: Part II
• Validation of subgradient optimization

Cited in

(5)

• MLQCC: an improved local search algorithm for the set k‐covering problem
• Simple Lagrangian heuristic for the set covering problem
• scientific article; zbMATH DE number 4121754 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• OR-Library

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)