✦ LIBER ✦

On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems

✍ Scribed by Al-Khayyal, Faiz A.; Sherali, Hanif D.

Book ID: 118205248
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 127 KB
Volume: 10
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s105262349935178x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Reduced Space Branch and Bound Algorit

A Reduced Space Branch and Bound Algorithm for Global optimization

✍ Thomas G. W. Epperly; Efstratios N. Pistikopoulos 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 177 KB

Developing Interval Global Optimization

Developing Interval Global Optimization Algorithms on the Basis of Branch-and-Bound and Constraint Propagation Methods

✍ Yuri G. Dolgov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 606 KB

Extensions to the repetitive branch and

Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression

✍ Réal A. Carbonneau; Gilles Caporossi; Pierre Hansen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Index branch-and-bound algorithm for Lip

Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints

✍ Yaroslav D. Sergeyev; Domenico Famularo; Paolo Pugliese 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 694 KB

Improve-and-Branch Algorithm for the Glo

Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems

✍ Marian G. Marcovecchio; María L. Bergamini; Pio A. Aguirre 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 320 KB

Improve-and-Branch Algorithm for the Glo

Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems

✍ Marian G. Marcovecchio; María L. Bergamini; Pio A. Aguirre 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 320 KB

A new algorithm to solve nonconvex NLP problems is presented. It is based on the solution of two problems. The reformulated problem RP is a suitable reformulation of the original problem and involves convex terms and concave univariate terms. The main problem MP is a nonconvex NLP that outer-approxi