The following pages link to (Q4735035):
Displaying 50 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- A genetic algorithm for the set covering problem (Q1278326) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
- On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Two new heuristics for the location set covering problem (Q1893520) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
- A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← 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)
- A heuristic algorithm for the set covering problem (Q4645914) (← links)
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
