An O(n) algorithm for the multiple-choice knapsack linear program
From MaRDI portal
Recommendations
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- scientific article; zbMATH DE number 3860891
- A fast algorithm for the linear multiple-choice knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- scientific article; zbMATH DE number 3889280
- A branch and bound algorithm for solving the multiple-choice 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
- An exact algorithm for large multiple knapsack problems
Cites work
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- An Algorithm for Large Zero-One Knapsack Problems
- Convex Analysis
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- The Linear Multiple Choice Knapsack Problem
- The Multiple-Choice Knapsack Problem
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Cited in
(38)- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Exact methods for the knapsack problem and its generalizations
- A new Lagrangian relaxation approach to the generalized assignment problem
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- Relaxation heuristics for a generalized assignment problem
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- The capacity expansion problem in the service industry
- A minimal algorithm for the multiple-choice knapsack problem
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem
- Exact approaches for the knapsack problem with setups
- Lagrangean/surrogate relaxation for generalized assignment problems
- Deriving expected values from probabilities of fuzzy subsets
- The linear multiple choice knapsack problem
- Minimizing the weighted number of tardy jobs on parallel processors
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Multiple-choice knapsack constraint in graphical models
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
- A linear-time algorithm for solving continuous maximin knapsack problems
- An optimal randomized algorithm for \(d\)-variate zonoid depth
- Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games
- Continuous maximin knapsack problems with GLB constraints
- scientific article; zbMATH DE number 3860891 (Why is no real title available?)
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- A dual approach for the continuous collapsing knapsack problem
- Minmax linear knapsack problem with grouped variables and gub
- Generalized correlated equilibrium for two-person games in extensive form with perfect information
- Budgeting with bounded multiple-choice constraints.
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Optimal sequential inspection policies
- Linear time algorithms for some separable quadratic programming problems
- Qini Curves for Multi-Armed Treatment Rules
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A fast algorithm for the linear multiple-choice knapsack problem
- Minimizing the weighted number of tardy jobs on a single machine with release dates
This page was built for publication: An O(n) algorithm for the multiple-choice knapsack linear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315277)
