An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394)

From MaRDI portal
Revision as of 00:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
scientific article

    Statements

    An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Monge matrices: dynamic programming
    0 references
    computational geometry
    0 references
    computational complexity
    0 references
    traveling salesman problem
    0 references