A 3-flip neighborhood local search for the set covering problem
From MaRDI portal
Publication:2490164
DOI10.1016/J.EJOR.2004.10.018zbMATH Open1120.90025OpenAlexW2039862033MaRDI QIDQ2490164FDOQ2490164
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
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
- Tabu Search—Part I
- A genetic algorithm for the set covering problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The traveling-salesman problem and minimum spanning trees: Part II
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Improved solutions to the Steiner triple covering problem
- Enhancing an algorithm for set covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- An algorithm for 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
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Title not available (Why is that?)
- Note: A local-search heuristic for large set-covering problems
- A Heuristic Method for the Set Covering Problem
- Logical analysis of numerical data
- An indirect genetic algorithm for set covering problems
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- Using a facility location algorithm to solve large set covering problems
- Simple Lagrangian heuristic for the set covering problem
Cited In (17)
- 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
- The set covering problem revisited: an empirical study of the value of dual information
- A variable neighborhood search algorithm for the multimode set covering problem
- MLQCC: an improved local search algorithm for the set k‐covering problem
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
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)
