Simple Lagrangian heuristic for the set covering problem

DOI10.1016/S0377-2217(96)00050-1zbMath0922.90114MaRDI QIDQ1278602

Salim Haddadi

Publication date: 18 October 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

set coveringsubgradient optimizationgreedy heuristicLagrangian dualityLagrangian heuristicredundant covers

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, A theoretical justification of the set covering greedy heuristic of Caprara et al., A 3-flip neighborhood local search for the set covering problem, Surrogate constraint normalization for the set covering problem, Resource-constrained management of heterogeneous assets with stochastic deterioration, An adaptive heuristic algorithm for VLSI test vectors selection, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Column generation extensions of set covering greedy heuristics

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhancing an algorithm for set covering problems
• An algorithm for set covering problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A Greedy Heuristic for the Set-Covering Problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Note—A Computational Survey of Methods for the Set Covering Problem
• The Set-Partitioning Problem: Set Covering with Equality Constraints