Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1075 12 |
Ultima descărcare din IBN: 2023-08-23 11:40 |
Căutarea după subiecte similare conform CZU |
004.94:519.16 (1) |
Informatică aplicată. Tehnici bazate pe calculator cu aplicații practice (438) |
Analiză combinatorică. Teoria grafurilor (114) |
SM ISO690:2012 UNGUREANU, Valeriu. Traveling Salesman Problem with Transportation. In: Computer Science Journal of Moldova, 2006, nr. 2(41), pp. 202-206. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||
Numărul 2(41) / 2006 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||
|
|||||
CZU: 004.94:519.16 | |||||
Pag. 202-206 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
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. |
|||||
Cuvinte-cheie Traveling Salesman Problem, TSPT, TSP |
|||||
|