Budgeting with bounded multiple-choice constraints.
From MaRDI portal
Publication:5928374
DOI10.1016/S0377-2217(99)00451-8zbMath1116.90381WikidataQ58826472 ScholiaQ58826472MaRDI QIDQ5928374
Publication date: 28 March 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Bounded multiple-choice knapsack problemDantzig-Wolfe decompositionDynamic programmingInteger programming
Related Items (11)
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Selection among ranked projects under segmentation, policy and logical constraints ⋮ A new multi-objective algorithm for a project selection problem ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints ⋮ New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems ⋮ An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition ⋮ Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming
Uses Software
Cites Work
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A minimal algorithm for the multiple-choice knapsack problem
- Decomposition Principle for Linear Programs
- An O(n) algorithm for the multiple-choice knapsack linear program
- An Algorithm for Large Zero-One Knapsack Problems
- The Multiple-Choice Knapsack Problem
- Unnamed Item
This page was built for publication: Budgeting with bounded multiple-choice constraints.
