✦ LIBER ✦

Sensitivity analysis for knapsack problems: a negative result

✍ Scribed by Charles Blair

Book ID: 104294829
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 422 KB
Volume: 81
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00080-2

No coin nor oath required. For personal study only.

✦ Synopsis

We show that, for any pair of knapsack problems, there is a single problem whose optimal solution corresponds to each problem of the pair, for two adjacent right-hand sides.

📜 SIMILAR VOLUMES

Sensitivity Analysis for Scheduling Prob

Sensitivity Analysis for Scheduling Problems

✍ Nicholas G. Hall; Marc E. Posner 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 302 KB

Sensitivity analysis of the knapsack pro

Sensitivity analysis of the knapsack problem: Tighter lower and upper bound limits

✍ Tarik Belgacem; Mhand Hifi 📂 Article 📅 2008 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 387 KB

Sensitivity analysis of the knapsack pro

Sensitivity analysis of the knapsack problem: tighter lower and upper bound limits

✍ Tarik Belgacem; Mhand Hifi 📂 Article 📅 2008 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 256 KB

A deterministic algorithm for modular kn

A deterministic algorithm for modular knapsack problems

✍ Arto Salomaa 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

Sensitivity analysis for some scheduling

Sensitivity analysis for some scheduling problems

✍ Zhen-duo Jiang; Shi-jie Sun; Zhi-gang Wu 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 192 KB