Successive Partition Methods

  • Reiner Horst
  • Hoang Tuy

Abstract

This chapter is devoted to a class of methods for concave minimization which investigate the feasible domain by dividing it into smaller pieces and refining the partition as needed (successive partition methods, branch and bound).

Keywords

Assure Rosen Prool 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Reiner Horst
    • 1
  • Hoang Tuy
    • 2
  1. 1.Department of MathematicsUniversity of TrierTrierGermany
  2. 2.Institute of MathematicsVien Toan HocHanoiVietnam

Personalised recommendations