✦ LIBER ✦

Branch and bound method for a parallel sequencing problem

✍ Scribed by K. V. Shakhbazyan; T. A. Tushkina

Book ID: 105327079
Publisher: Springer US
Year: 1977
Tongue: English
Weight: 483 KB
Volume: 7
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01846080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel branch-and-bound methods for th

Parallel branch-and-bound methods for thejob-shop scheduling problem

✍ Michael Perregaard; Jens Clausen 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 178 KB

A branch bound method for subset sum pro

A branch bound method for subset sum problem

✍ Shiquan Wu 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 631 KB

A branch and bound algorithm for the min

A branch and bound algorithm for the minimum storage-time sequencing problem

✍ P. Detti; D. Pacciarelli 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

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

Branch and bound methods for a search pr

Branch and bound methods for a search problem

✍ Alan R. Washburn 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A branch-and-bound parallel algorithm fo

A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem

✍ Mieczysław Wodecki 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB