✦ LIBER ✦

A branch-and-bound algorithm for the singly constrained assignment problem

✍ Scribed by P.M.D. Lieshout; A. Volgenant

Book ID: 108117002
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 211 KB
Volume: 176
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.05.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the gen

A branch and bound algorithm for the generalized assignment problem

✍ G. Terry Ross; Richard M. Soland 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

The singly constrained assignment proble

The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

✍ Jeffery L. Kennington; Farin Mohammadi 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 1005 KB

The singly constrained assignment proble

The singly constrained assignment problem: An AP basis algorithm

✍ Jeffery L. Kennington; Farin Mohammadi 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 947 KB

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

A branch-and-bound algorithm for the res

A branch-and-bound algorithm for the resource-constrained project scheduling problem

✍ U. Dorndorf; E. Pesch; T. Phan-Huy 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 184 KB

A branch and bound algorithm for the res

A branch and bound algorithm for the resource-constrained project scheduling problem

✍ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit