Sciweavers

Share
CSJM
2006

Traveling Salesman Problem with Transportation

9 years 4 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cutting-plane methods and Branch and Bound Techniques are obvious. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90. Keywords and phrases: Traveling Salesman Problem with Transportation and Fixed Additional Payments (TSPT), TSP, algorithm, computational complexity.
Valeriu Ungureanu
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CSJM
Authors Valeriu Ungureanu
Comments (0)
books