Optimization Online


More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming

Pierre Bonami(pierre.bonami***at***lif.univ-mrs.fr)
Jon Lee(jonxlee***at***umich.edu)
Sven Leyffer(leyffer***at***mcs.anl.gov)
Andreas Wächter(waechter***at***iems.northwestern.edu)

Abstract: Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MINLP, In this paper, we study and identify useful sophisticated branching methods for MINLP.


Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )


Download: [PDF]

Entry Submitted: 09/30/2011
Entry Accepted: 09/30/2011
Entry Last Modified: 09/30/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society