✦ LIBER ✦

A branch bound method for subset sum problem

✍ Scribed by Shiquan Wu

Book ID: 105433681
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1994
Tongue: English
Weight: 631 KB
Volume: 10
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02006860

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch and bound method for a parallel s

Branch and bound method for a parallel sequencing problem

✍ K. V. Shakhbazyan; T. A. Tushkina 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 483 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

Priority algorithms for the subset-sum p

Priority algorithms for the subset-sum problem

✍ Yuli Ye; Allan Borodin 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 732 KB

A polynomial approximation scheme for th

A polynomial approximation scheme for the subset sum problem

✍ Nei Yoshihiro Soma; Alan Solon Ivor Zinober; Horacio Hideki Yanasse; Peter John 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 462 KB

A Fast Approximation Algorithm for the S

A Fast Approximation Algorithm for the Subset-sum Problem

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

Parallel time and space upper-bounds for

Parallel time and space upper-bounds for the subset-sum problem

✍ C.A.A. Sanches; N.Y. Soma; H.H. Yanasse 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 430 KB