Hybrid heuristic algorithms for set covering.

DOI10.1016/S0305-0548(97)00084-1MaRDI QIDQ1406642zbMATH OpenOpenAlexFDO

Authors 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

AlgorithmsComputational complexityConstraint theoryHeuristic methodsInteger programmingLinear programmingMathematical modelsMinimal set coveringRecurrent neural networks

Mathematics Subject Classification ID

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

Recommendations

• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Algorithms for the set covering problem
• Hybrid heuristics for minimum cardinality set covering problems
• An efficient heuristic for large set covering problems
• A heuristic algorithm for the set covering problem

Cites work

• A genetic algorithm for the set covering problem
• 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
• An efficient heuristic for large set covering problems
• Connectionist networks for pivot selection in linear programming
• scientific article; zbMATH DE number 42654 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 735099 (Why is no real title available?)
• Linear programs for constraint satisfaction problems
• Note—A Computational Survey of Methods for the Set Covering Problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

Cited in

(3)

• A surrogate heuristic for set covering problems
• Hybrid heuristics for minimum cardinality set covering problems
• An efficient mean field approach to the set covering problem

This page was built for publication: Hybrid heuristic algorithms for set covering.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406642)