Inverse convex programming and parallelepiped packing

DOI10.1007/BF02366493zbMATH Open0879.90152MaRDI QIDQ1364041FDOQ1364041

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

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)

Cites Work

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

Cited In (5)

• Packing under convex quadratic constraints
• Minimax optimal placement problem for special-form objects on a multiply connected domain
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Packing of convex polytopes into a parallelepiped
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra

   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 of 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 👍 👎

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)