Pages that link to "Item:Q1290170"

The following pages link to A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems (Q1290170):

Displaying 15 items.

• The robust set covering problem with interval data (Q367647) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis (Q1623574) (← links)
• A hybrid simulated annealing/linear programming approach for the cover printing problem (Q1721187) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← 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)
• Variable employee productivity in workforce scheduling (Q2572245) (← links)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
• A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)