Circle and Sphere Packing

Guntram Scheithauer
Additional contact information
Guntram Scheithauer: TU Dresden

Chapter Chapter 13 in Introduction to Cutting and Packing Optimization, 2018, pp 385-405 from Springer

Abstract: Abstract Tasks of optimally packing circles or spheres mostly lead to mixed-integer nonlinear programming problems. Therefore, such problems can especially be hard to solve. Within this chapter we will address various problems of such kind and related solution strategies, in particular, the arrangement of identical or different circles within a circle, rectangle, or strip.

Keywords: Circle Packing Problem; Mixed Integer Nonlinear Programming Problem; Identical Circles; Local Extreme Points; Feasible Patterns (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-64403-5_13

Ordering information: This item can be ordered from
http://www.springer.com/9783319644035

DOI: 10.1007/978-3-319-64403-5_13

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().