Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070100275 / rank | |||
| Property / author | |||
| Property / author: Denis Naddef / rank | |||
| Property / author | |||
| Property / author: Denis Naddef / rank | |||
Normal rank | |||
| 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/s101070100275 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997949329 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070100275 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:37, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation |
scientific article |
Statements
Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (English)
0 references
20 August 2002
0 references
heuristics
0 references
traveling salesman problem
0 references
