The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:09, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The traveling salesman problem: new polynomial approximation algorithms and domination analysis |
scientific article |
Statements
The traveling salesman problem: new polynomial approximation algorithms and domination analysis (English)
0 references
2001
0 references