✦ LIBER ✦

On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

✍ Scribed by M. Locatelli; U. Raber

Book ID: 111535302
Publisher: Springer
Year: 2000
Tongue: English
Weight: 69 KB
Volume: 107
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1004604732705

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finiteness Result for the Simplicial Bra

Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

✍ M. Locatelli; U. Raber 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 54 KB

On the Convergence of Cone Splitting Alg

On the Convergence of Cone Splitting Algorithms with ω-Subdivisions

✍ B. Jaumard; C. Meyer 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 142 KB

On the convergence of two branch-and-bou

On the convergence of two branch-and-bound algorithms for nonconvex programming problems

✍ H. P. Benson 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 276 KB

A simplicial branch and bound duality-bo

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem

✍ Harold P. Benson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Product cooperative disassembly sequence

Product cooperative disassembly sequence planning based on branch-and-bound algorithm

✍ Xiu Fen Zhang; Shu You Zhang 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 442 KB

A simplicial branch and duality bound al

A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem

✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh