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...
Cote: | Libro Electrónico |
---|---|
Auteurs principaux: | Szabó, Péter Gábor (Auteur), Markót, Mihaly Csaba (Auteur), Csendes, Tibor (Auteur), Specht, Eckard (Auteur), Casado, Leocadio G. (Auteur), García, Inmaculada (Auteur) |
Collectivité auteur: | SpringerLink (Online service) |
Format: | Électronique eBook |
Langue: | Inglés |
Publié: |
New York, NY :
Springer US : Imprint: Springer,
2007.
|
Édition: | 1st ed. 2007. |
Collection: | Springer Optimization and Its Applications,
6 |
Sujets: | |
Accès en ligne: | Texto Completo |
Documents similaires
-
Linear and Integer Programming vs Linear Integration and Counting A Duality Viewpoint /
par: Lasserre, Jean-Bernard
Publié: (2009) -
Sparsity Graphs, Structures, and Algorithms /
par: Nešetřil, Jaroslav, et autres
Publié: (2012) -
Discrete Geometry and Optimization
Publié: (2013) -
Gems of Combinatorial Optimization and Graph Algorithms
Publié: (2015) -
Geometric Properties for Parabolic and Elliptic PDE's GPPEPDEs, Palinuro, Italy, May 2015 /
Publié: (2016)