𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Tarik Belgacem; Mhand Hifi

Book ID
107384111
Publisher
SP Systems Engineering Society of China
Year
2008
Tongue
English
Weight
256 KB
Volume
17
Category
Article
ISSN
1004-3756

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Calculating the upper bound of the Multi
Calculating the upper bound of the Multiple-Choice Knapsack Problem
✍ Yuji Nakagawa; Masachika Kitao; Mitsuhiro Tsuji; Yoshinobu Teraoka πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 179 KB

## Abstract An upper bound or a lower bound of the Multiple‐Choice Knapsack Problem can be calculated by solving LP relaxation. In 1979, Sinha and Zoltners proposed a branch‐and‐bound algorithm for solving the Multiple‐Choice Knapsack Problem, and provided a method to obtain the strict upper bound.

Resolution of the uniform lower bound pr
Resolution of the uniform lower bound problem in constructive analysis
✍ Erik Palmgren πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract In a previous paper we constructed a full and faithful functor ℳ︁ from the category of locally compact metric spaces to the category of formal topologies (representations of locales). Here we show that for a real‐valued continuous function __f__, ℳ︁(__f__) factors through the localic po