Pages that link to "Item:Q1282966"

The following pages link to Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966):

Displaying 7 items.

• Traveling salesman problem with clustering (Q616229) (← links)
• A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
• Adaptive schedules for ensemble-based threshold accepting (Q1808475) (← links)
• Record breaking optimization results using the ruin and recreate principle (Q1976826) (← links)
• The backbone method for ultra-high dimensional sparse machine learning (Q2163249) (← links)
• On the neighborhood structure of the traveling salesman problem generated by local search moves (Q2468271) (← links)
• OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES (Q2718392) (← links)