Synopsis
In this chapter, we concentrate on branching strategies for mixed-integer nonlinear programs. We introduce the notion of an ideal violation and use it to develop a partitioning technique for factorable programs. Not only does this partitioning scheme lead to a convergent branch-and-bound algorithm but it is found to be practically efficient as well. In the second part of this chapter, we study finiteness issues for branch-and-bound. In particular, we develop a finite branching scheme for stochastic two-stage integer programs with pure-integer recourse.
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
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tawarmalani, M., Sahinidis, N.V. (2002). Node Partitioning Schemes. In: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Nonconvex Optimization and Its Applications, vol 65. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3532-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3532-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5235-6
Online ISBN: 978-1-4757-3532-1
eBook Packages: Springer Book Archive