Note: A local-search heuristic for large set-covering problems
From MaRDI portal
Recommendations
Cites work
Cited in
(40)- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Solving large set covering problems on a personal computer
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- Algorithms for railway crew management
- A neural network for the minimum set covering problem
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Metaheuristics: A bibliography
- Morph-based local-search heuristics for large-scale combinatorial data analysis
- Solving the wire-harness design problem at a European car manufacturer
- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
- An improved configuration checking-based algorithm for the unicost set covering problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Iterated greedy for the maximum diversity problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Heuristics for a bidding problem
- 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
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- An efficient local search heuristic with row weighting for the unicost set covering problem
- An efficient heuristic for large set covering problems
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- Improved Local Computation Algorithm for Set Cover via Sparsification
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- Set covering approach for reconstruction of sibling relationships
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Particle therapy patient scheduling with limited starting time variations of daily treatments
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Geometric dominating-set and set-cover via local-search
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Iterated local search, iterated greedy and applications
- An effective and simple heuristic for the set covering problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Solution techniques for the large set covering problem
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
This page was built for publication: Note: A local-search 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 Q4859572)
