The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351): 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.1016/j.ejor.2012.06.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169846351 / rank | |||
Normal rank | |||
Revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(x\)-and-\(y\)-axes travelling salesman problem |
scientific article |
Statements
The \(x\)-and-\(y\)-axes travelling salesman problem (English)
0 references
27 July 2014
0 references
combinatorial optimization
0 references
polynomial-time algorithm
0 references
computational complexity
0 references
Euclidean travelling salesman problem
0 references
