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...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | Szabó, Péter Gábor (Autor), Markót, Mihaly Csaba (Autor), Csendes, Tibor (Autor), Specht, Eckard (Autor), Casado, Leocadio G. (Autor), García, Inmaculada (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New York, NY :
Springer US : Imprint: Springer,
2007.
|
Edición: | 1st ed. 2007. |
Colección: | Springer Optimization and Its Applications,
6 |
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Linear and Integer Programming vs Linear Integration and Counting A Duality Viewpoint /
por: Lasserre, Jean-Bernard
Publicado: (2009) -
Sparsity Graphs, Structures, and Algorithms /
por: Nešetřil, Jaroslav, et al.
Publicado: (2012) -
Discrete Geometry and Optimization
Publicado: (2013) -
Gems of Combinatorial Optimization and Graph Algorithms
Publicado: (2015) -
Geometric Properties for Parabolic and Elliptic PDE's GPPEPDEs, Palinuro, Italy, May 2015 /
Publicado: (2016)