Dynamic Three-Dimensional Linear Programming

DOI10.1287/IJOC.4.4.360MaRDI QIDQ4024308zbMATH OpenOpenAlexFDO

Authors David Eppstein

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

zbMATH Keywords

dynamic linear programmingplanar 2-center problem

Mathematics Subject Classification ID

Linear programming (90C05) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 3543798
• 3D dynamic programming approach to functional equations with applications
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming
• Linear programming and dynamics
• scientific article; zbMATH DE number 3921350
• Solving related two- and three-dimensional linear programming problems in logarithmic time
• scientific article; zbMATH DE number 3852820
• scientific article; zbMATH DE number 6613080
• A linear programming approach for the three-dimensional bin-packing problem

Cited in

(15)

• Geometric matching algorithms for two realistic terrains
• Linear Optimization Queries
• Optimal separable partitioning in the plane
• Efficient planar two-center algorithms
• Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
• Optimal algorithm for the planar two-center problem
• Efficient \(k\)-center algorithms for planar points in convex position
• On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
• A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)
• Clustering with few disks to minimize the sum of radii
• An optimal and practical algorithm for the planar 2-center problem
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• On the planar two-center problem and circular hulls
• A fast algorithm for the alpha-connected two-center decision problem

This page was built for publication: Dynamic Three-Dimensional Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024308)