An algorithm for the solution of the traveling salesman problem via disjunctive graphs

• Autorzy: Józef Grabowski
• Języki publikacji: EN

Abstrakty

PL

.

EN

From the introduction: "The traveling salesman problem is a problem of combinatorial type. Although problems of this type sometimes have a relatively simple formulation, there are many difficulties associated with their solution even when the most up-to-date computers are used. In the 1970s many papers have been devoted to this problem. The purpose of the vast majority of them has been to find more effective solution algorithms. "In this paper we give the solution of the traveling salesman problem via disjunctive graphs. Up to now the elements of disjunctive graphs have been used to solve problems connected with the determination of an optimal task completion sequence.''

Słowa kluczowe

EN

Directed graphs (digraphs), tournaments; Scheduling theory, deterministic; Special problems of linear programming(transportation, multi-index, etc.)

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1978
• Tom: 6
• Numer: 13

Daty

wydano

1978

online

1978-11-01

Twórcy

autor

Józef Grabowski

Identyfikatory

DOI

10.14708/ma.v6i13.1423