Pages that link to "Item:Q3318543"

The following pages link to An efficient heuristic for large set covering problems (Q3318543):

Displaying 40 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
• On the Weibull cost estimation of building frames designed by simulated annealing (Q604905) (← links)
• A meta-heuristic with orthogonal experiment for the set covering problem (Q702766) (← links)
• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• Using a facility location algorithm to solve large set covering problems (Q796457) (← links)
• An effective and simple heuristic for the set covering problem (Q853015) (← links)
• Solution techniques for the large set covering problem (Q868387) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Conditional covering: greedy heuristics and computational results (Q1091265) (← links)
• Solving large set covering problems on a personal computer (Q1097839) (← links)
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
• A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
• Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
• Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← 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)
• Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
• Clustering heuristics for set covering (Q1309879) (← links)
• A heuristic algorithm for the multi-criteria set-covering problems (Q1312032) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• A comparison of algorithm RS with algorithm OPTSOL70 (Q1383315) (← links)
• Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
• Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
• What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← 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)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• Un nuevo resultado sobre la complejidad del problema delP-centro (Q3035114) (← links)
• (Q4735035) (← links)
• Note: A local-search heuristic for large set-covering problems (Q4859572) (← links)
• A New Efficient Heuristic for the Minimum Set Covering Problem (Q4864354) (← links)