Pages that link to "Item:Q4371607"
From MaRDI portal
The following pages link to Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607):
Displayed 10 items.
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)