Pages that link to "Item:Q1026674"
From MaRDI portal
The following pages link to A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674):
Displaying 9 items.
- A new mixed integer programming model for curriculum balancing: application to a Turkish university (Q296758) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- An improved approximation algorithm for the maximum TSP (Q974748) (← links)
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem (Q2198264) (← links)
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
- New Imperialist Competitive Algorithm to solve the travelling salesman problem (Q2855772) (← links)
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink (Q2970607) (← links)
