Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1110.90072
Birgin, E.G.; Martínez, J.M.; Nishihara, F.H.; Ronconi, D.P.
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. (English)
[J] Comput. Oper. Res. 33, No. 12, 3535-3548 (2006). ISSN 0305-0548

Summary: The orthogonal packing of rectangular items in an arbitrary convex region is considered in this work. The packing problem is modeled as the problem of deciding for the feasibility or infeasibility of a set of nonlinear equality and inequality constraints. A procedure based on nonlinear programming is introduced and numerical experiments which show that the new procedure is reliable are exhibited. We address the problem of packing orthogonal rectangles within an arbitrary convex region. We aim to show that smooth nonlinear programming models are a reliable alternative for packing problems and that well-known general-purpose methods based on continuous optimization can be used to solve the models. Numerical experiments illustrate the capabilities and limitations of the approach.

MSC 2000:: *90C25 Convex programming
90C27 Combinatorial programming

Keywords: packing of rectangles; orthogonal packing; feasibility problems; models; nonlinear programming

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]