Hybrid heuristic algorithms for set covering.

DOI10.1016/S0305-0548(97)00084-1zbMath1040.90530OpenAlexW1970696450MaRDI QIDQ1406642

Angelo Monfroglio

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00084-1

zbMATH Keywords

Mathematical modelsAlgorithmsInteger programmingLinear programmingComputational complexityRecurrent neural networksConstraint theoryHeuristic methodsMinimal set covering

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the set covering problem
• Linear programs for constraint satisfaction problems
• A modified greedy heuristic for the set covering problem with improved worst case bound
• A surrogate heuristic for set covering problems
• An algorithm for set covering problem
• Connectionist networks for pivot selection in linear programming
• An efficient heuristic for large set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Note—A Computational Survey of Methods for the Set Covering Problem