An efficient local search heuristic with row weighting for the unicost set covering problem
DOI10.1016/J.EJOR.2015.05.038zbMATH Open1346.90702OpenAlexW1917814591MaRDI QIDQ319859FDOQ319859
Jinlong Li, Chao Gao, Thomas Weise, Xin Yao
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.038
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Algorithms for the set covering problem
- An effective and simple heuristic for the set covering problem
- Stochastic local search. Foundations and applications.
- A probabilistic heuristic for a computationally difficult set covering problem
- Title not available (Why is that?)
- Enhancing an algorithm for set covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- An algorithm for set covering problem
- Solving large Steiner Triple Covering Problems
- A 3-flip neighborhood local search for the 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
- 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?)
- Title not available (Why is that?)
- Note: A local-search heuristic for large set-covering problems
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A biased random-key genetic algorithm for the Steiner triple covering problem
- A GRASP algorithm to solve the unicost set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
Cited In (10)
- Solving the wire-harness design problem at a European car manufacturer
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- An improved configuration checking-based algorithm for the unicost set covering problem
- A set-cover-based approach for the test-cost-sensitive attribute reduction problem
- Proof of covering minimality by generalizing the notion of independence
- A 3-flip neighborhood local search for the set covering problem
- MLQCC: an improved local search algorithm for the set k‐covering problem
Uses Software
This page was built for publication: An efficient local search heuristic with row weighting for the unicost set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319859)
