An efficient local search heuristic with row weighting for the unicost set covering problem
From MaRDI portal
(Redirected from Publication:319859)
Recommendations
Cites work
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 790416 (Why is no real title available?)
- A 3-flip neighborhood local search for the set covering problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A GRASP algorithm to solve the unicost set covering problem
- A Greedy Heuristic for the Set-Covering Problem
- A Heuristic Method for the Set Covering Problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A biased random-key genetic algorithm for the Steiner triple covering problem
- A genetic algorithm for the set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithms for railway crew management
- Algorithms for the set covering problem
- An algorithm for set covering problem
- An effective and simple heuristic for the set covering problem
- An efficient heuristic for large set covering problems
- An electromagnetism metaheuristic for the unicost set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Enhancing an algorithm for set covering problems
- Note: A local-search heuristic for large set-covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Solving large Steiner Triple Covering Problems
- Stochastic local search. Foundations and applications.
- The set covering problem revisited: an empirical study of the value of dual information
Cited in
(13)- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
- A 3-flip neighborhood local search for the set covering problem
- Solving the wire-harness design problem at a European car manufacturer
- An effective and simple heuristic for the set covering problem
- A set-cover-based approach for the test-cost-sensitive attribute reduction problem
- MLQCC: an improved local search algorithm for the set k‐covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- A hybrid heuristic for the set covering problem
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- Proof of covering minimality by generalizing the notion of independence
- 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
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
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)
