Pages that link to "Item:Q1278602"

The following pages link to Simple Lagrangian heuristic for the set covering problem (Q1278602):

Displaying 17 items.

• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
• Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
• An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
• A comparison of algorithm RS with algorithm OPTSOL70 (Q1383315) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
• A two-phase heuristic for set covering (Q2204628) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (Q3786281) (← links)
• (Q4735035) (← links)
• A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)