Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (Q3890444)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem |
scientific article |
Statements
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem (English)
0 references
1980
0 references
asymmetric travelling salesman problem
0 references
subtour elimination approach
0 references
breadth-first branch and bound algorithm
0 references
computation of partial lower bounds
0 references
computational results
0 references
random problems
0 references
assignment problem
0 references
