✦ LIBER ✦

An enhanced branch-and-bound algorithm for a partitioning problem

✍ Scribed by Michael J. Brusco

Book ID: 111778086
Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 178 KB
Volume: 56
Category: Article
ISSN: 0007-1102
DOI: 10.1348/000711003321645359

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 new branch-&-bound-enhanced genetic al

A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem

✍ Menouar Boulif; Karim Atif 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 451 KB

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB

An LC branch-and-bound algorithm for the

An LC branch-and-bound algorithm for the module assignment problem

✍ Maw-Sheng Chern; G.H. Chen; Pangfeng Liu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 707 KB

A branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 KB

A branch and bound algorithm for the tra

A branch and bound algorithm for the traveling purchaser problem

✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm