Pages that link to "Item:Q1917273"
From MaRDI portal
The following pages link to Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273):
Displayed 19 items.
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem (Q1388833) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)