Note: A local-search heuristic for large set-covering problems
From MaRDI portal
Publication:4859572
DOI<1129::AID-NAV3220420711>3.0.CO;2-M 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-MzbMath0839.90085OpenAlexW1970316557MaRDI QIDQ4859572
Michael J. Brusco, Larry W. Jacobs
Publication date: 1 February 1996
Full work available at URL: https://doi.org/10.1002/1520-6750(199510)42:7<1129::aid-nav3220420711>3.0.co;2-m
Related Items
An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ An effective and simple heuristic for the set covering problem ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Algorithms for railway crew management ⋮ Metaheuristics: A bibliography ⋮ Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates ⋮ 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 ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Iterated greedy for the maximum diversity problem ⋮ Set covering approach for reconstruction of sibling relationships ⋮ 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 ⋮ A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data ⋮ A neural network for the minimum set covering problem ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
Cites Work
