Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality (Q3888840): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/mnsc.26.5.495 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.26.5.495 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114552889 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MNSC.26.5.495 / rank | |||
Normal rank | |||
Latest revision as of 23:31, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality |
scientific article |
Statements
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality (English)
0 references
1980
0 references
symmetric travelling salesman problems
0 references
large-scale test problems
0 references
computational study
0 references
cutting-plane approach
0 references
branch-and-bound
0 references
subtour- elimination
0 references
comb constraints
0 references
valid inequalities
0 references
combinatorial optimization
0 references
linear integer programming
0 references
