Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 1156.90013
Castillo, Ignacio; Kampas, Frank J.; Pintér, János D.
Solving circle packing problems by global optimization: numerical results and industrial applications. (English)
[J] Eur. J. Oper. Res. 191, No. 3, 786-802 (2008). ISSN 0377-2217

Summary: A (general) circle packing is an optimized arrangement of $N$ arbitrary sized circles inside a container (e.g., a rectangle or a circle) such that no two circles overlap. In this paper, we present several circle packing problems, review their industrial applications, and some exact and heuristic strategies for their solution. We also present illustrative numerical results using `generic' global optimization software packages. Our work highlights the relevance of global optimization in solving circle packing problems, and points towards the necessary advancements in both theory and numerical practice.

MSC 2000:: *90C26 Nonconvex programming
90B85 Continuous location

Keywords: circle packing problems; global optimization; industrial applications; numerical examples

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]