The Linear Multiple Choice Knapsack Problem
From MaRDI portal
Cited in
(24)- An O(n) algorithm for the multiple-choice knapsack linear program
- Continuous maximin knapsack problems with GLB constraints
- A linear-time algorithm for solving continuous maximin knapsack problems
- A new Lagrangian relaxation approach to the generalized assignment problem
- A versatile algorithm for assembly line balancing
- The knapsack problem with generalized upper bounds
- A fast algorithm for the linear multiple-choice knapsack problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A dual approach for the continuous collapsing knapsack problem
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines
- Qini Curves for Multi-Armed Treatment Rules
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- A minimal algorithm for the multiple-choice knapsack problem
- Exact methods for the knapsack problem and its generalizations
- A note on the knapsack problem with special ordered sets
- On search over rationals
- Optimal sequential inspection policies
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- The linear multiple choice knapsack problem
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
This page was built for publication: The Linear Multiple Choice Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893672)
