A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem |
scientific article; zbMATH DE number 6591520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem |
scientific article; zbMATH DE number 6591520 |
Statements
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
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (English)
0 references
