✦ LIBER ✦

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

✍ Scribed by Mirjam Dür

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 97 KB
Volume: 91
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100236

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fuzziness and branch and bound procedure

Fuzziness and branch and bound procedures: Applications to separation sequencing

✍ L. Pibouleau; P. Floquet; S. Domenech 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 221 KB

The aim of the paper is to identify optimal and near-optimal distillation sequences according to a particular objective function deÿnition. The potential solutions are valuated from the point of view of practical considerations, rather than purely costing methods. Four rules of thumb addressing colu

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 branch-and-bound algorithm applied to

A branch-and-bound algorithm applied to optimal radar search pattern

✍ Pierre Dodin; Pierre Minvielle; Jean-Pierre Le Cadre 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 752 KB

New error bounds and their applications

New error bounds and their applications to convergence analysis of iterative algorithms

✍ Zhi-Quan Luo 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 85 KB

A branch-and-bound algorithm to minimize

A branch-and-bound algorithm to minimize total tardiness with different release dates

✍ Chengbin Chu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

An efficient branch and bound algorithm

An efficient branch and bound algorithm to solve the quadratic integer programming problem

✍ F. Körner 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 333 KB