Crossref journal-article
Springer Science and Business Media LLC
Journal of Optimization Theory and Applications (297)
Bibliography

Benson, H. P. (1982). On the convergence of two branch-and-bound algorithms for nonconvex programming problems. Journal of Optimization Theory and Applications, 36(1), 129–134.

Authors 1
  1. H. P. Benson (first)
References 4 Referenced 23
  1. Falk, J. E., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550?569, 1969. (10.1287/mnsc.15.9.550) / Management Science by J. E. Falk (1969)
  2. Horst, R.,An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312?321, 1976. (10.1007/BF01580678) / Mathematical Programming by R. Horst (1976)
  3. Horst, R., Private Communication, 1980.
  4. Benson, H. P.,On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems, University of Florida, Center for Econometrics and Decision Sciences, Discussion Paper No. 3, 1979.
Dates
Type When
Created 20 years, 8 months ago (Jan. 1, 2005, 10:31 p.m.)
Deposited 6 years, 4 months ago (April 29, 2019, 1:45 p.m.)
Indexed 3 years, 5 months ago (March 29, 2022, 5:02 p.m.)
Issued 43 years, 8 months ago (Jan. 1, 1982)
Published 43 years, 8 months ago (Jan. 1, 1982)
Published Print 43 years, 8 months ago (Jan. 1, 1982)
Funders 0

None

@article{Benson_1982, title={On the convergence of two branch-and-bound algorithms for nonconvex programming problems}, volume={36}, ISSN={1573-2878}, url={http://dx.doi.org/10.1007/bf00934342}, DOI={10.1007/bf00934342}, number={1}, journal={Journal of Optimization Theory and Applications}, publisher={Springer Science and Business Media LLC}, author={Benson, H. P.}, year={1982}, month=jan, pages={129–134} }