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

This publication has 8 references indexed in Scilit:

• Using total monotonicity for two optimization problems on the plane
  Information Processing Letters, 1996
• Perspectives of Monge properties in optimization
  Discrete Applied Mathematics, 1996
• The convex-hull-and-line traveling salesman problem: a solvable case
  Information Processing Letters, 1994
• Improved Algorithms for Economic Lot Size Problems
  Operations Research, 1993
• A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time
  Information Processing Letters, 1991
• On-line dynamic programming with applications to the prediction of RNA secondary structure
  Journal of Algorithms, 1991
• Geometric applications of a matrix-searching algorithm
  Algorithmica, 1987
• Efficient special case algorithms for the n‐line planar traveling salesman problem
  Networks, 1980