Volume maximization and orthoconvex approximation of orthogons

DOI10.1007/S006070050037MaRDI QIDQ1969296zbMATH OpenOpenAlexFDO

Authors M. M. Miatselski, Rainer E. Burkard

Publication date 29 October 2000

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070050037

zbMATH Keywords

combinatorial optimizationconstrained critical path problemcutting stockgeometric optimizationorthoconvex approximationpolynomially solvable casesVLSI design

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Finding optimal shadows of polytopes
• Finding largest rectangles in convex polygons
• On simple polygonalizations with optimal area
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Polynomial time algorithms for maximizing the intersection volume of polytopes

Cited in

(1)

• Maximum-Volume Symmetric Gauge Ball Problem on the Convex Cone of Positive Definite Matrices and Convexity of Optimal Sets

This page was built for publication: Volume maximization and orthoconvex approximation of orthogons

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