✦ LIBER ✦

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

✍ Scribed by Menouar Boulif; Karim Atif

Book ID: 108105676
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 451 KB
Volume: 33
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An enhanced branch-and-bound algorithm f

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

✍ Michael J. Brusco 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

A hybrid grouping genetic algorithm for

A hybrid grouping genetic algorithm for the cell formation problem

✍ Tabitha L. James; Evelyn C. Brown; Kellie B. Keeling 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 802 KB

A simulated annealing algorithm for manu

A simulated annealing algorithm for manufacturing cell formation problems

✍ Tai-Hsi Wu; Chin-Chih Chang; Shu-Hsing Chung 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 178 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

A branch and bound algorithm for the acy

A branch and bound algorithm for the acyclic subgraph problem

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB