Pages that link to "Item:Q1195106"
From MaRDI portal
The following pages link to A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106):
Displaying 17 items.
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- The period traveling salesman problem: A new heuristic algorithm (Q1603331) (← links)
- An improved heuristic for the period traveling salesman problem (Q1885978) (← links)
- A new heuristic for the period traveling salesman problem (Q1894732) (← links)
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- On the high multiplicity traveling salesman problem (Q2494812) (← links)
- A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems (Q2987911) (← links)
- The travelling salesman problem: selected algorithms and heuristics† (Q3033569) (← links)
- A tour construction heuristic for the travelling salesman problem (Q3157386) (← links)
- A heuristic circulation-network approach to solve the multi-traveling salesman problem (Q3787810) (← links)
- Heuristic algorithms for a multi-period multi-stop transportation planning problem (Q4656719) (← links)
- On a routing and scheduling problem concerning multiple edge traversals in graphs (Q5318269) (← links)