Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem (Q1183812)
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: Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem |
scientific article; zbMATH DE number 33760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem |
scientific article; zbMATH DE number 33760 |
Statements
Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem (English)
0 references
28 June 1992
0 references
integer-valued planar grid
0 references
approximate algorithms
0 references
