An efficient heuristic for large set covering problems
From MaRDI portal
Recommendations
- A heuristic algorithm for the set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Note: A local-search heuristic for large set-covering problems
- An effective and simple heuristic for the set covering problem
- scientific article; zbMATH DE number 4121754
Cited in
(44)- Conditional covering: greedy heuristics and computational results
- Solving large set covering problems on a personal computer
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- A probabilistic heuristic for a computationally difficult set covering problem
- Pick-and-choose heuristics for partial set covering
- Parallel and serial heuristics for the minimum set cover problem
- Enhancing an algorithm for set covering problems
- An adaptation of SH heuristic to the location set covering problem
- A genetic algorithm for the set covering problem
- Simple Lagrangian heuristic for the set covering problem
- Pareto optimality and a class of set covering heuristics
- Clustering heuristics for set covering
- A heuristic algorithm for the multi-criteria set-covering problems
- A surrogate heuristic for set covering problems
- Hybrid heuristic algorithms for set covering.
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- What is the best greedy-like heuristic for the weighted set covering problem?
- Dominant, an algorithm for the \(p\)-center problem.
- Heuristic methods and applications: A categorized survey
- Two new heuristics for the location set covering problem
- Solving the wire-harness design problem at a European car manufacturer
- Column generation extensions of set covering greedy heuristics
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- An improved configuration checking-based algorithm for the unicost 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
- Un nuevo resultado sobre la complejidad del problema delP-centro
- Solving set covering problems of large dimension
- An efficient local search heuristic with row weighting for the unicost set covering problem
- scientific article; zbMATH DE number 3875302 (Why is no real title available?)
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Note: A local-search heuristic for large set-covering problems
- A New Efficient Heuristic for the Minimum Set Covering Problem
- Heuristic solutions and confidence intervals for the multicovering problem
- Maximally disjoint solutions of the set covering problem
- On the Weibull cost estimation of building frames designed by simulated annealing
- Integrated differentiated time slot pricing and order dispatching with uncertain customer demand in on-demand food delivery
- A meta-heuristic with orthogonal experiment for the set covering problem
- Exploring further advantages in an alternative formulation for the set covering problem
- Using a facility location algorithm to solve large set covering problems
- An effective and simple heuristic for the set covering problem
- Solution techniques for the large set covering problem
- Surrogate constraint normalization for the set covering problem
This page was built for publication: An efficient heuristic for large set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318543)
