Abstract
This chapter presents the advanced version of our fully interval-based branch-and-bound optimization algorithm for solving point arrangement problems. Our starting point is again the B&B algorithm framework and the generally applicable interval tools described in Chapter 6. As one of the most efficient parts of the new algorithm, an interval-based form of a previously known version of the ‘method of active regions’ will be introduced. This method represents the remaining areas still of interest as polygons, having calculated them in a reliable way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). The Improved Version of the Interval Optimization Method. In: New Approaches to Circle Packing in a Square. Springer Optimization and Its Applications, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-45676-8_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-45676-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-45673-7
Online ISBN: 978-0-387-45676-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)