Solving large set covering problems on a personal computer
From MaRDI portal
Recommendations
- Algorithms for large scale set covering problems
- Note: A local-search heuristic for large set-covering problems
- A heuristic algorithm for the set covering problem
- A two-phase heuristic for set covering
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- An efficient heuristic for large set covering problems
- Computer Solutions to Minimum-Cover Problems
- Hybrid heuristics for minimum cardinality set covering problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Using a facility location algorithm to solve large set covering problems
Cited in
(10)- scientific article; zbMATH DE number 4106856 (Why is no real title available?)
- A column generation approach to job grouping for flexible manufacturing systems
- A surrogate heuristic for set covering problems
- Hybrid heuristics for minimum cardinality set covering problems
- Solution techniques for the large set covering problem
- Note: A local-search heuristic for large set-covering problems
- Algorithms for large scale set covering problems
- Solving the set cover problem on a supercomputer
- Surrogate constraint normalization for the set covering problem
- Using a facility location algorithm to solve large set covering problems
This page was built for publication: Solving large set covering problems on a personal computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097839)
