✦ LIBER ✦

A branch and bound algorithm for globally solving a class of nonconvex programming problems

✍ Scribed by Hongwei Jiao

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 574 KB
Volume: 70
Category: Article
ISSN: 0362-546X
DOI: 10.1016/j.na.2008.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for solving

A branch and bound algorithm for solving a class of nonlinear integer programming problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

A new accelerating method for globally s

A new accelerating method for globally solving a class of nonconvex programming problems

✍ Peiping Shen; Xiaodi Bai; Weimin Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi

A branch-and-bound algorithm for solving

A branch-and-bound algorithm for solving fixed charge problems

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB

A branch and bound algorithm with constr

A branch and bound algorithm with constraint partitioning for integer goal programming problems

✍ Jeffrey L. Arthur; A. Ravindran 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A branch and bound algorithm for solving

A branch and bound algorithm for solving the multiple-choice knapsack problem

✍ M.E. Dyer; N. Kayal; J. Walker 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 865 KB