Solving traveling salesman problems using branch and bound methods
The traveling salesman problem is a well known optimization problem. Optimal solutions to small instances can be found in reasonable time by linear programming. However, since the TSP is NP-hard, it will be very time consuming to solve larger instances with guaranteed optimality. Setting optimalit...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/1836/1/FH03-FIK-20-38046.pdf http://eprints.unisza.edu.my/1836/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|