✦ LIBER ✦

The problem of “problem choice”

✍ Scribed by J. M. Ziman

Publisher: Springer
Year: 1987
Tongue: English
Weight: 1004 KB
Volume: 25
Category: Article
ISSN: 0026-4695
DOI: 10.1007/bf01096858

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Problem on the Axiom of Choice

✍ A. H. Kruse 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

Economic choice, political decision, and

Economic choice, political decision, and the problem of

✍ Michael C. Munger 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 345 KB

The linking set problem: a polynomial sp

The linking set problem: a polynomial special case of the multiple-choice knapsack problem

✍ A. Agra; C. Requejo 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 177 KB

An algorithm for the solution of a choic

An algorithm for the solution of a choice problem

✍ Yu. E. Guliev; N. A. Mamed-zade 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 136 KB

The problem of adaptive individual choic

The problem of adaptive individual choice in cultural evolution

✍ Catherine Driscoll 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 151 KB

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.