Pages that link to "Item:Q4105495"
From MaRDI portal
The following pages link to Integer programming approaches to the travelling salesman problem (Q4105495):
Displayed 9 items.
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- An exact algorithm for minimizing routing and operating costs in depot location (Q1148218) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- The seriation problem and the travelling salesman problem (Q1252153) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach (Q3217446) (← links)
- Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496) (← links)
- The use of relaxation techniques to solve certain mathematical decision‐making problems (Q3865861) (← links)
- Using cutting planes to solve the symmetric Travelling Salesman problem (Q4175048) (← links)