Skip to main content
SpringerLink
Log in

MINLP: Branch and Bound Methods

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adjiman CS, Androulakis IP, Floudas CA (1997) Global optimization of MINLP problems in process synthesis and design. Comput Chem Eng 21(1001):S445–S450

    Google Scholar 

  2. Beale EML (1977) Integer programming. In: Jacobs D (ed) The State of the Art in Numerical Analysis. Acad. Press, New York p 409–448

    Google Scholar 

  3. Bienstock D (1996) Computational study of a family of mixed-integer quadratic programming problems. Math Program 74(2):121–140

    Article  MathSciNet  Google Scholar 

  4. Borchers B, Mitchell JE (1994) An improved branch and bound algorithm for mixed integer nonlinear programs. Comput Oper Res 21(4):359–367

    Article  MathSciNet  MATH  Google Scholar 

  5. Borchers B, Mitchell JE (1997) A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs. Comput Oper Res 24(8):699–701

    Article  MathSciNet  MATH  Google Scholar 

  6. Brink A, Westerlund T (1995) The joint problem of model structure determination and parameter estimation in quantitative IR spectroscopy. Chemometrics and Intelligent Laboratory Systems 29:29–36

    Article  Google Scholar 

  7. Dakin RJ (1965) A tree–search algorithm for mixed integer programming problems. Comput J 8:250–255

    Article  MathSciNet  MATH  Google Scholar 

  8. Fletcher R, Leyffer S (1998) Numerical experience with lower bounds for MIQP branch-and-bound. SIAM J Optim 8:604–616

    Article  MathSciNet  MATH  Google Scholar 

  9. Floudas CA (1995) Nonlinear and mixed-integer optimization: fundamentals and applications. Oxford Univ. Press, Oxford

    MATH  Google Scholar 

  10. Gavish B, Horsky D, Srikanth K (1983) An approach to the optimal positioning of a new product. Managem Sci 29(11):1277–1297

    MATH  Google Scholar 

  11. Gupta OK, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Managem Sci 31(12):1533–1546

    MathSciNet  MATH  Google Scholar 

  12. Hoang Hai Hoc (1982) Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition. IEEE Trans Autom Control 27:164–169

    Article  MATH  Google Scholar 

  13. Land A, Doig A (1960) An automatic method of solving discrete programming problems. Econometrika 28(3):497–520

    Article  MathSciNet  MATH  Google Scholar 

  14. Laughhunn DJ (1970) Quadratic binary programming with applications to capital-budgeting problems. Oper Res 18(3):454–461

    Article  MATH  Google Scholar 

  15. Lawler EL, Wood DE (1966) Branch and bound methods: A survey. Oper Res 14(4):699–719

    Article  MathSciNet  MATH  Google Scholar 

  16. Lee EK, Mitchell JE (1997) Computational experience of an interior point algorithm in a parallel branch-and-cut framework. In: Proc. Eighth SIAM Conf. Parallel Processing for Sci. Computing, Minneapolis, March 1997. www.siam.org/catalog/mcc07/heath97.htm

  17. Ryoo HS, Sahinidis NV (1996) A branch–and–reduce approach to global optimization. J Global Optim 8(2):107–139

    Article  MathSciNet  MATH  Google Scholar 

  18. Sahinidis NV (1996) BARON: A general purpose global optimization software package. J Global Optim 8(2):201–205

    Article  MathSciNet  MATH  Google Scholar 

  19. Stubbs RA, Mehrotra S (1999) A branch-and-cut method for 0–1 mixed convex programming. Math Program 80:515–532

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, New Mexico Tech., Socorro, USA

    Brian Borchers

Authors
  1. Brian Borchers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Borchers, B. (2008). MINLP: Branch and Bound Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_378

Download citation

Publish with us

Policies and ethics

Search

Navigation