✦ LIBER ✦

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

Publisher: Society of Manufacturing Engineers
Year: 1993
Tongue: English
Weight: 155 KB
Volume: 12
Category: Article
ISSN: 0278-6125
DOI: 10.1016/0278-6125(93)90249-s

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

✍ Andrew Kusiak 📂 Article 📅 1991 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 736 KB

Efficient solving of the group technolog

Efficient solving of the group technology problem: A. Kusiak, W. Chow, pp. 117–24

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

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

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

A New Algorithm for Solving the Word Pro

A New Algorithm for Solving the Word Problem in Braid Groups

✍ D. Garber; S. Kaplan; M. Teicher 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi

A branch-and-bound algorithm for solving

A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production

✍ J. Haberl; Chr Nowak; H. Stettner; G. Stoiser; H. Woschitz 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 582 KB