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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient special case algorithms for the n-line planar traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex-hull-and-line traveling salesman problem: A solvable case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line dynamic programming with applications to the prediction of RNA secondary structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(98)00137-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120168175 / rank
 
Normal rank

Latest revision as of 11:40, 30 July 2024

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
    Monge matrices: dynamic programming
    0 references
    computational geometry
    0 references
    computational complexity
    0 references
    traveling salesman problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references