## Find a copy online

### Links to this item

Ebook Central Available to Stanford-affiliated users.

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Print version: New approaches to circle packing in a square. New York : Springer, ©2007 (DLC) 2006932708 (OCoLC)123181404 |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
P G Szabó |

ISBN: | 9780387456768 0387456767 0387456732 9780387456737 |

OCLC Number: | 186565534 |

Description: | 1 online resource (xiv, 238 pages) : illustrations. |

Contents: | Preface -- Glossary of Symbols -- 1. Introduction and Problem History -- 2. Problem Definitions and Formulations -- 3. Bounds for the Optimum Values -- 4. Approximate Circle Packings Using Optimization Methods -- 5. Other Methods for Finding Approximate Circle Packings -- 6. Interval Methods for Validating Optimal Solutions -- 7. The First Fully Interval-based Optimization Method -- 8. The Improved Version of the Interval Optimization Method -- 9. Interval Methods for Verifying Structural Optimality -- 10. Repeated Patterns in Circle Packings -- 11. Minimal Polynomials of Point Arrangements -- 12. About the Codes Used -- Appendix A. Currently Best Known Results for Packing Congruent Circles in a Square -- Bibliography -- Related Web Sites -- List of Figures -- List of Tables -- Index. |

Series Title: | Springer optimization and its applications, v. 6. |

Responsibility: | by P.G. Szábo [and others]. |

More information: |

### Abstract:

## Reviews

*Editorial reviews*

Publisher Synopsis

From the reviews:"The book under review gives a detailed survey on the achievements of the last years on the problem of finding densest packings ... . The text is written in a very comprehensive and informative way, and all the numerical results on densities are impressively illustrated by many figures of `optimal' packings. ... will serve as an excellent source for everybody, expert on non-expert, who is interested in circle packing or, who is just interested in the hardness of an appealing problem in discrete geometry." (Martin Henk, Zentralblatt MATH, Vol. 1128 (6), 2008) Read more...

*User-contributed reviews*