RO EN
Traveling Salesman Problem with Transportation
Authors: Valeriu Ungureanu
Keywords: NTraveling Salesman Problem with Transportation and Fixed Additional Payments (TSPT), TSP, algorithm, computational complexity.
Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.
– 0.12 Mb
Keywords: NTraveling Salesman Problem with Transportation and Fixed Additional Payments (TSPT), TSP, algorithm, computational complexity.
Abstract
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.
V. Ungureanu,
State University of Moldova,
60, A. Mateevici str.,
Chisinau, MD-2009, Moldova.
E-mail :
State University of Moldova,
60, A. Mateevici str.,
Chisinau, MD-2009, Moldova.
E-mail :
Fulltext
– 0.12 Mb
Contents
- Local and Global Parsing with Functional X-bar Theory and SCD Linguistic Strategy (II.) Part II. Functional Generative Capacity, SCD Marker Classes, and Local / Global Segmentation / Parsing Algorithms
- Text Classification Using Word-Based PPM Models
- Traveling Salesman Problem with Transportation
- On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
- Query by Constraint Propagation in the Concept-Oriented Data Model
- The Development Methodology of the UML Electronic Guide
- The effects of Ethernet LANs' fragmentation
- Macroeconomic growth determining
