✦ LIBER ✦

Branching algorithms for solving the group technology problem

✍ Scribed by Andrew Kusiak

Publisher: Society of Manufacturing Engineers
Year: 1991
Tongue: English
Weight: 736 KB
Volume: 10
Category: Article
ISSN: 0278-6125
DOI: 10.1016/0278-6125(91)90028-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branching algorithms for solving the gro

Branching algorithms for solving the group technology problem: A. Kusiak, pp. 332–343

📂 Article 📅 1993 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 155 KB

Efficient solving of the group technolog

Efficient solving of the group technology problem

✍ Andrew Kusiak; Wing S. Chow 📂 Article 📅 1987 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 563 KB

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

A new branching rule for the branch and

A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems

✍ Frank Körner 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 374 KB

An Algorithm for Solving the Factorizati

An Algorithm for Solving the Factorization Problem in Permutation Groups

✍ T. Minkwitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,

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