Pages that link to "Item:Q4859572"

The following pages link to Note: A local-search heuristic for large set-covering problems (Q4859572):

Displaying 38 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
• An effective and simple heuristic for the set covering problem (Q853015) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Solution techniques for the large set covering problem (Q868387) (← links)
• A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
• Solving large set covering problems on a personal computer (Q1097839) (← links)
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems (Q1290170) (← links)
• Algorithms for railway crew management (Q1365052) (← links)
• A neural network for the minimum set covering problem (Q1577203) (← links)
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Morph-based local-search heuristics for large-scale combinatorial data analysis (Q1963866) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• Heuristics for a bidding problem (Q2489281) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
• An efficient heuristic for large set covering problems (Q3318543) (← links)
• A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>‐covering problem (Q4601636) (← links)
• Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513) (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• Particle therapy patient scheduling with limited starting time variations of daily treatments (Q6066719) (← links)
• MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)