Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
From MaRDI portal
Publication:1316098
DOI10.1016/0167-6377(93)90052-IzbMath0799.90098MaRDI QIDQ1316098
Publication date: 27 November 1994
Published in: Operations Research Letters (Search for Journal in Brave)
global optimization; nonconvex minimization; computational geometry; parametric simplex algorithm; rectangle of minimum area; successive underestimation method
Related Items
An outcome-space finite algorithm for solving linear multiplicative programming, An efficient algorithm for globally solving generalized linear multiplicative programming, Solving a class of multiplicative programs with 0-1 knapsack constraints, An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- A parametric successive underestimation method for convex multiplicative programming problems
- Linear multiplicative programming
- Divide and conquer for linear expected time
- An efficient algorithm for determining the convex hull of a finite planar set
- The Efficiency of the Simplex Method: A Survey
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- A Multistage Solution of the Template-Layout Problem
- State Constraints in Convex Control Problems of Bolza
