Budgeting with bounded multiple-choice constraints.

DOI10.1016/S0377-2217(99)00451-8MaRDI QIDQ5928374zbMATH OpenDBLPWikidataFDO

Authors David Pisinger

Publication date 28 March 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00451-8

zbMATH Keywords

Bounded multiple-choice knapsack problemDantzig-Wolfe decompositionDynamic programmingInteger programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• An exact algorithm for the budget-constrained multiple knapsack problem
• The linear multiple choice knapsack problem
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• The multiple-choice multi-period knapsack problem

Cites work

• A minimal algorithm for the multiple-choice knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• An O(n) algorithm for the multiple-choice knapsack linear program
• Decomposition Principle for Linear Programs
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• The Multiple-Choice Knapsack Problem

Cited in

(14)

• 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
• Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
• 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
• Budget management with applications
• A dynamic model of soft budget-constraint
• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
• Selection among ranked projects under segmentation, policy and logical constraints
• Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• An optimal solution for the budgets assignment problem
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• A new multi-objective algorithm for a project selection problem

Describes a project that uses

Uses Software

• CPLEX
• Knapsack

This page was built for publication: Budgeting with bounded multiple-choice constraints.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928374)