Tabu search-based metaheuristic algorithm for large-scale set covering problems

MaRDI QIDQ3500142zbMATH OpenFDO

Authors Marco Caserta

Publication date 3 June 2008

zbMATH Keywords

primal-to-dual

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A heuristic algorithm for the set covering problem
• Algorithms for large scale set covering problems
• An algorithm for set covering problem
• The set covering problem revisited: an empirical study of the value of dual information
• An efficient heuristic for large set covering problems

Cited in

(12)

• Relaxation heuristics for the set multicover problem with generalized upper bound constraints
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
• An improved configuration checking-based algorithm for the unicost set covering problem
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• A set covering approach for multi-depot train driver scheduling
• RAMP for the capacitated minimum spanning tree problem
• The set covering problem revisited: an empirical study of the value of dual information
• A self-adaptive biogeography-based algorithm to solve the set covering problem
• The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
• MLQCC: an improved local search algorithm for the set k‐covering problem
• An electromagnetism metaheuristic for the unicost set covering problem

This page was built for publication: Tabu search-based metaheuristic algorithm for large-scale set covering problems

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