✦ LIBER ✦

A Reduced Space Branch and Bound Algorithm for Global optimization

✍ Scribed by Thomas G. W. Epperly; Efstratios N. Pistikopoulos

Book ID: 110260234
Publisher: Springer US
Year: 1997
Tongue: English
Weight: 177 KB
Volume: 11
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1008212418949

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An interval branch and bound algorithm f

An interval branch and bound algorithm for global optimization of a multiperiod pricing model

✍ M.A. Venkataramanan; A.V. Cabot; W.L. Winston 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 467 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

Target-Oriented Branch and Bound Method

Target-Oriented Branch and Bound Method for Global Optimization

✍ Volker Stix 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 204 KB

The reduced cost branch and bound algori

The reduced cost branch and bound algorithm for mixed integer programming

✍ R.Kipp Martin; Dennis J. Sweeney; Michael E. Doherty 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 860 KB

A branch-and-bound algorithm for discret

A branch-and-bound algorithm for discrete multi-factor portfolio optimization model

✍ Shu-fen Niu; Guo-xin Wang; Xiao-ling Sun 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 194 KB

A branch-reduce-cut algorithm for the gl

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs

✍ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non