MathematicsComputer Science
T. Ibaraki, T. Hasegawa, Katsumi Teranaka, Jiro Iwase
tlooto Summary
Two approximate algorithms and an exact branch-and-bound algorithm are proposed, by making use of the property that the LP relaxation of P provides considerably accurate upper and lower bounds of the optimal value of P.
Abstract
Abstract is not available.
Citation format
IBARAKI, T., et al. THE MULTIPLE-CHOICE KNAPSACK PROBLEM. Journal of the Operations Research Society of Japan, 1978, 21: 59–95.