Advertisement

Branch and bound methods

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 268)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BENS82A]
    Benson, H.P. On the convergence of two branch and bound algorithms for nonconvex programming problems. JOTA 36 (1982), 129–134.CrossRefGoogle Scholar
  2. [BENS82B]
    Benson, H.P. Algorithms for parametric nonconvex programming. JOTA 38 (1982), 316–340.Google Scholar
  3. [BENS85]
    Benson, H.P. A finite algorithm for concave minimization over a polyhedron. Naval. Res. Log. Quarterly 32 (1985), 165–177.Google Scholar
  4. [BEAL80]
    Beale, E.M. Branch and bound methods for numerical optimization of nonconvex functions. Proc. Fourth Sympos. on Computational Statistics, Edinburgh 1980, pp 11–20, Physica, Vienna.Google Scholar
  5. [BEAL76]
    Beale, E.M. and Forrest, J.J.H. Global optimization using special ordered sets. Math. Progr. 10 (1976), 52–69.CrossRefGoogle Scholar
  6. [BEAL78]
    Beale, E.M. and Forrest, J.J.H. Global optimization as an extension of integer programming. In: Towards Global Optimization 2, L.C. Dixon and G.P. Szego, eds. North-Holland, Amsterdam (1978), 131–149.Google Scholar
  7. [BEAL70]
    Beale, E.M. and Tomlin, J.A. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. Proc. 5th Intern. Confer. on Oper. Research, 1970 (ed. J. Lawrence), 447–454.Google Scholar
  8. [BEAL79]
    Beale, E.M. Branch and bound methods for mathematical programming systems. Annals of Discrete Math. 5 (1979), 201–210.Google Scholar
  9. [FALK72]
    Falk, J.E. An algorithm for locating approximate global solutions for nonconvex separable problems. Technical Paper Serial T-262 (1972), Program in Logistics, George Washington Univ.Google Scholar
  10. [FALK69]
    Falk, J.E. and Soland, R.M. An algorithm for separable nonconvex programming problems. Management Sc. 15 (1969), 550–569.Google Scholar
  11. [FALK76]
    Falk, J.E. and Hoffman K.L. A successive underestimating method for concave minimization problems. Math. Oper. Reser. 1 (1976), 251–259.Google Scholar
  12. [GROT76]
    Grotte, J.H. Program MOGG-A code for solving separable nonconvex optimization problems. P-1318 (1976), The Institute for Defense Analysis, Arlington, VA.Google Scholar
  13. [HOFF75]
    Hoffman, K.L. A successive underestimating method for concave minimization problems. Ph.D. thesis (1975), George Washington Univ.Google Scholar
  14. [HOFF81]
    Hoffman, K.L. A method for globally minimizing concave functions over convex sets. Math. Progr. 20 (1981), 22–32.CrossRefGoogle Scholar
  15. [HORS76]
    Horst, R. An algorithm for nonconvex programming problems. Math. Progr. 10 (1976), 312–321.CrossRefGoogle Scholar
  16. [HORS78]
    Horst, R. A new approach for separable nonconvex minimization problems including a method for finding the global minimum of a function of a single variable. Proceedings in Oper. Res. 7, Sixth Annual Meeting, Deutsch-Geselsch. Oper. Res. Christian-Albrechts, Univ. Kiel 1978, 39–47.Google Scholar
  17. [HORS80]
    Horst, R. A note on the convergence of an algorithm for nonconvex programming problems. Math. Progr. 19 (1980), 237–238.CrossRefGoogle Scholar
  18. [HORS85]
    Horst, R. A general class of branch and bound methods in global optimization with some new approaches for concave minimization. To appear in JOTA (1985).Google Scholar
  19. [McCO72]
    McCormick, G.P. Attempts to calculate global solutions of problems that may have many local minima. Numerical Methods in Nonlinear Optimization, F.A. Lootsma, ed. Academic Press, N.Y. (1972), 209–221.Google Scholar
  20. [McCO76]
    McCormick, G.P. Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems. Math. Progr. 10 (1976), 147–175.CrossRefGoogle Scholar
  21. [McCO83]
    McCormick, G.P. Nonlinear Programming: Theory algorithms and applications. John Wiley and Sons, N.Y. (1983).Google Scholar
  22. [SOLA71]
    Soland, R.M. An algorithm for separable nonconvex programming problems II: nonconvex constraints. Management Sci. 17 (1971), 759–773.Google Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations