✦ LIBER ✦

A polynomial-time algorithm for knapsack with divisible item sizes

✍ Scribed by W.F.J. Verhaegh; E.H.L. Aarts

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 369 KB
Volume: 62
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00061-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A PTAS for the chance-constrained knapsa

A PTAS for the chance-constrained knapsack problem with random item sizes

✍ Vineet Goyal; R. Ravi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 441 KB

A polynomial time algorithm for producti

A polynomial time algorithm for production planning with bounded inventory

✍ X. Liu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB

A polynomial-time algorithm for a flow-s

A polynomial-time algorithm for a flow-shop batching problem with

✍ Peter Brucker; Natalia V. Shakhlevich 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 691 KB

A simple decomposition algorithm for sup

A simple decomposition algorithm for support vector machines with polynomial-time convergence

✍ Hong Qiao; Yan-Guo Wang; Bo Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 185 KB

A polynomial time algorithm for rectilin

A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves

✍ Brazil, M.; Thomas, D. A.; Weng, J. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

Computational experience with a polynomi

Computational experience with a polynomial-time dual simplex algorithm for the transportation problem

✍ Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 572 KB