Abstract
This chapter is devoted to a class of methods for concave minimization which investigate the feasible domain by dividing it into smaller pieces and refining the partition as needed (successive partition methods, branch and bound).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horst, R., Tuy, H. (1996). Successive Partition Methods. In: Global Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03199-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-03199-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08247-4
Online ISBN: 978-3-662-03199-5
eBook Packages: Springer Book Archive