Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem (Q5684831): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:32, 7 March 2024
scientific article; zbMATH DE number 3420485
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem |
scientific article; zbMATH DE number 3420485 |
Statements
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem (English)
0 references
1973
0 references
