New Approaches to Circle Packing in a Square With Program Codes /
In one sense, the problem of finding the densest packing of congruent circles in a square is easy to understand: it is a matter of positioning a given number of equal circles in such a way that the circles fit fully in a square without overlapping. But on closer inspection, this problem reveals itse...
Call Number: | Libro Electrónico |
---|---|
Main Authors: | Szabó, Péter Gábor (Author), Markót, Mihaly Csaba (Author), Csendes, Tibor (Author), Specht, Eckard (Author), Casado, Leocadio G. (Author), García, Inmaculada (Author) |
Corporate Author: | SpringerLink (Online service) |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
New York, NY :
Springer US : Imprint: Springer,
2007.
|
Edition: | 1st ed. 2007. |
Series: | Springer Optimization and Its Applications,
6 |
Subjects: | |
Online Access: | Texto Completo |
Similar Items
-
Linear and Integer Programming vs Linear Integration and Counting A Duality Viewpoint /
by: Lasserre, Jean-Bernard
Published: (2009) -
Sparsity Graphs, Structures, and Algorithms /
by: Nešetřil, Jaroslav, et al.
Published: (2012) -
Discrete Geometry and Optimization
Published: (2013) -
Gems of Combinatorial Optimization and Graph Algorithms
Published: (2015) -
Geometric Properties for Parabolic and Elliptic PDE's GPPEPDEs, Palinuro, Italy, May 2015 /
Published: (2016)