THE MULTIPLE-CHOICE KNAPSACK PROBLEM

DOI10.15807/jorsj.21.59zbMath0379.90076OpenAlexW2158536378MaRDI QIDQ4158817

Toshiharu Hasegawa, Katsumi Teranaka, Jiro Iwase, Toshihide Ibaraki

Publication date: 1978

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.21.59

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Exact methods for the knapsack problem and its generalizations, An approximate binary search algorithm for the multiple-choice knapsack problem, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem, Branch-and-cut for linear programs with overlapping SOS1 constraints, A Fast Approximation Algorithm For The Subset-Sum Problem, A dual approach for the continuous collapsing knapsack problem, A polyhedral study of the semi-continuous knapsack problem, Optimal sequential inspection policies, Approximation schemes for deal splitting and covering integer programs with multiplicity constraints, Complex-demand scheduling problem with application in smart grid, Models for representing piecewise linear cost functions, Branch-and-cut for complementarity-constrained optimization, An O(n) algorithm for the multiple-choice knapsack linear program, Continuous maximin knapsack problems with GLB constraints, 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, Heuristic allocation based on a dynamic programming state-space representation