Inverse convex programming and parallelepiped packing

DOI10.1007/BF02366493MaRDI QIDQ1364041zbMATH OpenFDO

Authors L. A. Sobolenko, B. N. Pshenichnyĭ

Publication date 24 August 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

location probleminverse convex programmingpacking of parallelepipeds

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Packing of convex polytopes into a parallelepiped
• Packing under convex quadratic constraints
• Packing under convex quadratic constraints
• A semidefinite programming hierarchy for packing problems in discrete geometry
• Two approaches to modeling and solving the packing problem for convex polytopes
• A problem of packing homothetic convex polytopes
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra
• Bidimensional Packing by Bilinear Programming
• Bidimensional packing by bilinear programming
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization

Cites work

• Linearization method for inverse convex programming
• Orbit and coset analysis of the Golay and related codes

Cited in

(6)

• The construction of a mathematical model and the solution of the problem of arrangement of convex \(n\)-dimensional polytopes in an \(n\)-dimensional parallelepiped
• Packing of convex polytopes into a parallelepiped
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Minimax optimal placement problem for special-form objects on a multiply connected domain
• Packing under convex quadratic constraints
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra

This page was built for publication: Inverse convex programming and parallelepiped packing

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