Node Partitioning Schemes

  • Mohit Tawarmalani
  • Nikolaos V. Sahinidis
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 65)


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.


Global Optimization Problem Linear Relaxation Partition Element Factorable Program Stochastic Integer Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Mohit Tawarmalani
    • 1
  • Nikolaos V. Sahinidis
    • 2
  1. 1.Purdue UniversityWest LafayetteUSA
  2. 2.University of IllinoisUrbanaUSA

Personalised recommendations