A 3-flip neighborhood local search for the set covering problem

DOI10.1016/J.EJOR.2004.10.018MaRDI QIDQ2490164zbMATH OpenOpenAlexFDO

Authors Masahiro Kishida, Toshihide Ibaraki, Mutsunori Yagiura

Publication date 28 April 2006

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

Full work available at URL https://doi.org/10.1016/j.ejor.2004.10.018

zbMATH Keywords

Lagrangian relaxationMetaheuristicsStrategic oscillationSet covering problemLarge neighborhood

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40)

Recommendations

• Note: A local-search heuristic for large set-covering problems
• An efficient local search heuristic with row weighting for the unicost set covering problem
• A heuristic algorithm for the set covering problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Algorithms for large scale set covering problems

Cites work

• scientific article; zbMATH DE number 4121754 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A Heuristic Method for the Set Covering Problem
• A Lagrangian-based heuristic for large-scale set covering problems
• A genetic algorithm for the set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A probabilistic heuristic for a computationally difficult set covering problem
• An algorithm for set covering problem
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• An indirect genetic algorithm for set covering problems
• Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
• Enhancing an algorithm for set covering problems
• Improved solutions to the Steiner triple covering problem
• Logical analysis of numerical data
• Note: A local-search 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
• Simple Lagrangian heuristic for the set covering problem
• Tabu Search—Part I
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The traveling-salesman problem and minimum spanning trees: Part II
• Using a facility location algorithm to solve large set covering problems

Cited in

(17)

• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
• MLQCC: an improved local search algorithm for the set k‐covering problem
• RAMP for the capacitated minimum spanning tree problem
• Solving the wire-harness design problem at a European car manufacturer
• A new approach for solving set covering problem using jumping particle swarm optimization method
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• An efficient local search heuristic with row weighting for the unicost set covering problem
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints
• A GRASP algorithm to solve the unicost set covering problem
• The robust set covering problem with interval data
• An electromagnetism metaheuristic for the unicost set covering problem
• An improved configuration checking-based algorithm for the unicost set covering problem
• A hybrid heuristic for the set covering problem
• A set covering approach for multi-depot train driver scheduling
• A variable neighborhood search algorithm for the multimode set covering problem
• The set covering problem revisited: an empirical study of the value of dual information

This page was built for publication: A 3-flip neighborhood local search for the set covering problem

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