Inverse convex programming and parallelepiped packing
type: Item
instance of: scholarly article
title: Inverse convex programming and parallelepiped packing
zbMATH Open document ID: 0879.90152
DOI: 10.1007/BF02366493
author: L. A. Sobolenko
author: B. N. Pshenichnyĭ
published in: Cybernetics and Systems Analysis
publication date: 1997-08-24T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1051087
zbMATH Keywords: inverse convex programming
zbMATH Keywords: location problem
zbMATH Keywords: packing of parallelepipeds
MaRDI profile type: Publication
cites work: Linearization method for inverse convex programming
cites work: Orbit and coset analysis of the Golay and related codes
Recommended article: Packing of convex polytopes into a parallelepiped
Recommended article: Packing Under Convex Quadratic Constraints
Recommended article: Packing under convex quadratic constraints
Recommended article: A semidefinite programming hierarchy for packing problems in discrete geometry
Recommended article: Two approaches to modeling and solving the packing problem for convex polytopes
Recommended article: A problem of packing of homothetic convex polytopes
Recommended article: Multistage approach to solving the optimization problem of packing nonconvex polyhedra
Recommended article: Bidimensional Packing by Bilinear Programming
Recommended article: Bidimensional packing by bilinear programming
Recommended article: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
description: scientific article; zbMATH DE number 1051087