𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear Time Algorithms for Knapsack Problems with Bounded Weights

✍ Scribed by David Pisinger

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
140 KB
Volume
33
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The critical-item, upper bounds, and a b
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
✍ Shaw, Dong X.; Cho, Geon πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac

On Linear-Time Deterministic Algorithms
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
✍ Bernard Chazelle; Jiřı́ MatouΕ‘ek πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 208 KB

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O Ε½ d . , which is better than those for previously known algori

Local stabilization for linear discrete-
Local stabilization for linear discrete-time systems with bounded controls and norm-bounded time-varying uncertainty
✍ Sophie Tarbouriech; Germain Garcia πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 139 KB πŸ‘ 2 views

The problem of the local stabilization of linear discrete-time systems subject to bounded controls and suffering from uncertainty of the norm-bounded time-varying type is addressed. From the solution of a certain discrete Riccati equation, a control gain and a set of safe initial conditions are obta