Pages that link to "Item:Q1609913"
From MaRDI portal
The following pages link to Relaxed tours and path ejections for the traveling salesman problem (Q1609913):
Displayed 18 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)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Data structures and ejection chains for solving large-scale traveling salesman problems (Q1887873) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- A columnar competitive model for solving multi-traveling salesman problem (Q2482590) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- An Efficient Genetic Algorithm for the Traveling Salesman Problem (Q3058949) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)