The following pages link to TSP ejection chains (Q1363749):
Displaying 12 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- A \(k\)-level data structure for large-scale traveling salesman problems (Q512957) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A simulated annealing approach to the traveling tournament problem (Q880541) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas (Q2315629) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
