✦ LIBER ✦

A branch and bound algorithm for the response time variability problem

✍ Scribed by Alberto García-Villoria, Albert Corominas, Xavier Delorme…

Book ID: 120729776
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 404 KB
Volume: 16
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-012-0277-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 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

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 max

A branch and bound algorithm for the maximum clique problem

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB

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