Sometimes Travelling is Easy: The Master Tour Problem (Q4388980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480195281878 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2119735681 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 30 July 2024
scientific article; zbMATH DE number 1150884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sometimes Travelling is Easy: The Master Tour Problem |
scientific article; zbMATH DE number 1150884 |
Statements
Sometimes Travelling is Easy: The Master Tour Problem (English)
0 references
11 May 1998
0 references
travelling salesman problem
0 references
Kalmanson condition
0 references
master tour
0 references
combinatorial optimization
0 references
polynomial time
0 references
