Inverse convex programming and parallelepiped packing

DOI10.1007/BF02366493zbMath0879.90152MaRDI QIDQ1364041

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)

Related Items (2)

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

Cites Work

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

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