✦ LIBER ✦

Surrogate duality in a branch-and-bound procedure

✍ Scribed by Mark H. Karwan; Ronald L. Rardin

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 482 KB
Volume: 28
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800280107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new node selection strategy in the bra

A new node selection strategy in the branch-and-bound procedure

✍ Liao Ching-Jong 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 693 KB

The asymmetric M-travelling salesmen pro

The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm

✍ A Iqbal Ali; Jeff L Kennington 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 925 KB

Dual bounding procedures lead to converg

Dual bounding procedures lead to convergent Branch–and–Bound algorithms

✍ Mirjam Dür 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 97 KB

An exact branch-and-bound procedure for

An exact branch-and-bound procedure for the quadratic-assignment problem

✍ M. S. Bazaraa; A. N. Elshafei 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 927 KB

A branch and bound procedure for the ree

A branch and bound procedure for the reentrant permutation flow-shop scheduling problem

✍ Jen-Shiang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 184 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