Dynamic Three-Dimensional Linear Programming
From MaRDI portal
Publication:4024308
DOI10.1287/ijoc.4.4.360zbMath0758.90078OpenAlexW2017411365MaRDI QIDQ4024308
Publication date: 25 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.4.4.360
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Dynamic programming (90C39) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\) ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Optimal separable partitioning in the plane ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Efficient planar two-center algorithms ⋮ Geometric matching algorithms for two realistic terrains ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ On the planar two-center problem and circular hulls
