Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

CSJM
2006

favoriteEmaildiscussreport

59views more CSJM 2006»

Traveling Salesman Problem with Transportation

13 years 11 months ago

Traveling Salesman Problem with Transportation

Download www.math.md

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

Real-time Traffic

Classical Transportation Problem | Classical Tsp | CSJM 2006 | Salesman Problem |

claim paper

Related Content

» An Improved Exact Algorithm for Cubic Graph TSP

» Bee Colony Optimization with Local Search for Traveling Salesman Problem

» Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Tra...

» Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evol...

» Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3Cycle Cover Problem...

» An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

» New facets of the STS polytope generated from known facets of the ATS polytope

» Generalized Traveling Salesman Problem Reduction Algorithms

» On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CSJM
Authors	Valeriu Ungureanu

Comments (0)