✦ LIBER ✦

Budgeting with bounded multiple-choice constraints

✍ Scribed by David Pisinger

Book ID: 108445639
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 169 KB
Volume: 129
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(99)00451-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Choice and constraint in budget-making

✍ Jan-Erik Lane; Anders Westlund 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 543 KB

The knapsack problem with disjoint multi

The knapsack problem with disjoint multiple-choice constraints

✍ Vijay Aggarwal; Narsingh Deo; Dilip Sarkar 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 750 KB

The 0–1 knapsack problem with multiple c

The 0–1 knapsack problem with multiple choice constraints

✍ Robert M. Nauss 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Reliability optimization of a series sys

Reliability optimization of a series system with multiple-choice and budget constraints using an efficient ant colony approach

✍ Fardin Ahmadizar; Hiresh Soltanpanah 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 207 KB

BANKRUPTCIES WITH SOFT BUDGET CONSTRAINT

✍ KAREL JANDA 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

A dynamic programming algorithm for mult

A dynamic programming algorithm for multiple-choice constraints

✍ Mary W. Cooper; Keyvan Farhangian 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 315 KB

## This report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programmi