Pages that link to "Item:Q1823139"

The following pages link to An algorithm for set covering problem (Q1823139):

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 of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
• Solving a fuzzy set-covering problem (Q557144) (← 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)
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
• A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
• Solving the set cover problem on a supercomputer (Q910182) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
• An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• The multicovering problem (Q1205691) (← 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)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← 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)
• Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
• Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
• The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
• A neural network for the minimum set covering problem (Q1577203) (← links)
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
• On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• A special case of set covering problems (Q1908929) (← links)
• Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Optimized item selection to boost exploration for recommender systems (Q2117247) (← links)
• Set covering problem with conflict constraints (Q2147026) (← 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)
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
• An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)