An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394)
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: An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays |
scientific article; zbMATH DE number 6590768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays |
scientific article; zbMATH DE number 6590768 |
Statements
An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (English)
0 references
9 June 2016
0 references
Monge matrices: dynamic programming
0 references
computational geometry
0 references
computational complexity
0 references
traveling salesman problem
0 references
0 references
0.7601954936981201
0 references
0.753056526184082
0 references
0.7528906464576721
0 references
0.7501446604728699
0 references
