A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A domination algorithm for {0,1}-instances of the travelling salesman problem |
scientific article |
Statements
A domination algorithm for {0,1}-instances of the travelling salesman problem (English)
0 references
10 June 2016
0 references
travelling salesman problem
0 references
algorithms
0 references
combinatorial dominance
0 references
0 references
0 references
0 references
0 references
0 references
