✦ LIBER ✦

A branch and bound algorithm for the generalized assignment problem

✍ Scribed by G. Terry Ross; Richard M. Soland

Publisher: Springer-Verlag
Year: 1975
Tongue: English
Weight: 578 KB
Volume: 8
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580430

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel branch and bound algorithm fo

A parallel branch and bound algorithm for the quadratic assignment problem

✍ Catherine Roucairol 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 746 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 parallel depth first search branch and

A parallel depth first search branch and bound algorithm for the quadratic assignment problem

✍ Bernard Mans; Thierry Mautor; Catherine Roucairol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A branch-and-bound algorithm for the qua

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

✍ Peter Hahn; Thomas Grant; Nat Hall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 927 KB

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

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