Pages that link to "Item:Q1887873"
From MaRDI portal
The following pages link to Data structures and ejection chains for solving large-scale traveling salesman problems (Q1887873):
Displaying 11 items.
- Social structure optimization in team formation (Q342472) (← links)
- 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 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)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← 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)