Pages that link to "Item:Q4170533"
From MaRDI portal
The following pages link to Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges (Q4170533):
Displaying 9 items.
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- The multiple-robot assembly plan problem (Q685191) (← links)
- The multiagent planning problem (Q2012788) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets (Q2283818) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
