Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Some Important Classes of Global Optimization Problems Read chapter Read first chapter

1990 | OriginalPaper | Chapter

Branch and Bound

Authors : Professor Dr. Reiner Horst, Professor Dr. Hoang Tuy

Published in: Global Optimization

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

A widely used method to solve various kinds of difficult optimization problems is called branch and bound. In this technique, the feasible set is relaxed and subsequently split into parts (branching) over which lower (and often also upper) bounds of the objective function value can be determined (bounding).

previous chapter Concavity Cuts
next chapter Cutting Methods
Metadata
Title
Branch and Bound
Authors
Professor Dr. Reiner Horst
Professor Dr. Hoang Tuy
Copyright Year
1990
Publisher
Springer Berlin Heidelberg
Book
Global Optimization

Print ISBN: 978-3-662-02600-7

Electronic ISBN: 978-3-662-02598-7

Copyright Year: 1990

DOI
https://doi.org/10.1007/978-3-662-02598-7_4

Premium Partner

    Image Credits