The Linear Multiple Choice Knapsack Problem
From MaRDI portal
Publication:3893672
DOI10.1287/opre.28.6.1412zbMath0447.90064OpenAlexW2157513965MaRDI QIDQ3893672
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.6.1412
fast algorithmimplementationlinear programming relaxationlinear multiple choice knapsack problemrunning time complexity
Related Items
Exact methods for the knapsack problem and its generalizations, 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 minimal algorithm for the multiple-choice knapsack problem, R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines, Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem, A dual approach for the continuous collapsing knapsack problem, Optimal sequential inspection policies, A note on the knapsack problem with special ordered sets, On search over rationals, A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints, AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints, SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing, 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, LP relaxation of the two dimensional knapsack problem with box and GUB constraints, A branch and bound algorithm for solving the multiple-choice knapsack problem, An O(n) algorithm for the linear multiple choice knapsack problem and related problems, The linear multiple choice knapsack problem, Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem, A fast algorithm for the linear multiple-choice knapsack problem
