Pages that link to "Item:Q4770207"

The following pages link to Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem (Q4770207):

Displaying 17 items.

• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• The multiple-robot assembly plan problem (Q685191) (← links)
• On single courier problem (Q941049) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem (Q1130070) (← links)
• Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
• The multiagent planning problem (Q2012788) (← links)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets (Q2283818) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
• On general routing problems (Q4143017) (← links)
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)