Pages that link to "Item:Q1824572"
From MaRDI portal
The following pages link to New lower bounds for the symmetric travelling salesman problem (Q1824572):
Displaying 7 items.
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
