R. D. Armstrong
- 1 BALINTFY, J L, Ross, g. T., sINHA, P., AND ZOLTNERS, A. A. A mathematical programming system for preference-maximized nonselective menu planning and scheduling. Math. Program 15 (1978), 63-76.Google Scholar
- 2 BEALE, E.M.L., AND TOMLIN, J.A. An integer programming approach to class of combinatorial problems. Math. Program. 3 (1972), 339-344.Google Scholar
- 3 FISHER, M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Scl. 27, 1 (1981), 1-18.Google Scholar
- 4 GARFINKEL, R.S., AND NEMHAUSER, G.L. Integer Programming. Wiley, New York, 1972.Google Scholar
- 5 GEOFFRION, A.M. Langrangian relaxation for integer programming. Math. Program. Study. 2 (1974), 82-114.Google Scholar
- 6 GEOFFRION, A.M., AND MARSTEN, R.E. Integer programming algorithms A framework and state-of-the-art survey. Manage. Sci. 18, 7 (1972), 465-491.Google Scholar
- 7 GLOVER, F. Surrogate constraint duality in mathematical programming. Oper. Res. 23, 3 (1975), 434-451.Google Scholar
- 8 GLOVER, F., AND KLINGMAN, D A o(n log n) algorithm for LP knapsacks with GUB constraints. Math. Program. 17 (1979), 345-361.Google Scholar
- 9 KOLESAR, P. Assignment of optimal redundancy in systems subject to failure Operations Research Group Tech. Rep., Columbia Univ., New York, 1966.Google Scholar
- 10 KUNG, D.S. The Mulhple Choice Knapsack Problem: Algorithms and Apphcatmns. Ph.D (hssertation, Umv. of Texas, Austin, 1982.Google Scholar
- 11 LORtE, J., AND SAVAGE, L. Three problems in capital rationing. J. Bus. 38 (1955), 229-239.Google Scholar
- 12 SISHA, P., AND ZOLTNERS, A.A. The multiple-choice knapsack problem. Oper Res. 27, 3 (May/ June 1979), 503-515.Google Scholar
- 13 SINHA, P., AND ZOLTNERS, A.A. Integer programming models for sales resource allocation. Manage. Sc~. 26, 3 (1989), 242-260.Google Scholar
- 14 WEINGARTNER, H. Capital budgeting and interrelated projects: Survey and synthesis. Manage Sci. 12, 7 (1968), 485-516.Google Scholar
Index Terms
- A computational study of a multiple-choice knapsack algorithm
Recommendations
A computational study on the quadratic knapsack problem with multiple constraints
The quadratic knapsack problem (QKP) has been the subject of considerable research in recent years. Despite notable advances in special purpose solution methodologies for QKP, this problem class remains very difficult to solve. With the exception of ...
The Multiple-Choice Knapsack Problem
The multiple-choice knapsack problem is defined as a binary knapsack problem with the addition of disjoint multiple-choice constraints. The strength of the branch-and-bound algorithm we present for this problem resides with the quick solution of the ...
The linear multiple choice knapsack problem
The multiple choice knapsack problem is defined as a knapsack problem with additional mutually exclusive multiple choice constraints. We present an algorithm for solving the linear programming relaxation of the multiple choice knapsack problem. The ...
Comments