Symmetric travelling salesman problem. Some new algorithmic possibilities (Q2418713): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-981-13-3059-9_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2903330333 / rank | |||
Normal rank | |||
Latest revision as of 22:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetric travelling salesman problem. Some new algorithmic possibilities |
scientific article |
Statements
Symmetric travelling salesman problem. Some new algorithmic possibilities (English)
0 references
28 May 2019
0 references
symmetrical travelling salesman problem
0 references
pedigree polytope
0 references
hypergraph simplex
0 references
multistage insertion formulation
0 references
compact formulations
0 references
