Development of a hybrid dynamic programming approach for solving discrete nonlinear knapsack problems

Applied Mathematics and Computation

Volumn 188, Issue 1, 2007, Pages 1023-1030

  Ghassemi Tari, Farhad ^a   Jahangiri, Eshagh ^b  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b Industrial Management Institute   (Iran)

Author keywords

Discrete nonlinear knapsack; Imbedded state; Multiple choice knapsack; Surrogate constraint

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA STORAGE EQUIPMENT; NONLINEAR EQUATIONS; PROBLEM SOLVING;

DECISION VARIABLES; DISCRETE NONLINEAR KNAPSACK PROBLEM (DNKP); IMBEDDED STATE; SURROGATE CONSTRAINTS;

DYNAMIC PROGRAMMING;

EID: 34247608752     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.10.067     Document Type: Article

References (16)

1. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
2. Mathur K., Salkin H.M., and Marito S. A branch and search algorithm for a class of nonlinear knapsack problem. Operations Research Letters 2 4 (1983) 155-160
3. Glover F. Surrogate constraint duality in mathematical programming. Operations Research 23 5 (1970) 434-451
4. Greenberg H.J. The generalized penalty functions/surrogate model. Operations Research 18 (1973) 162-178
5. Mizukami K., and Sikrorski J. Three algorithms for calculating surrogate constraint in integer programming problem. Control and Cybernetics 13 4 (1984) 375-397
6. Morin L.T., and Esogbue M.U. The imbedded state space approach for reducing dimensionality in dynamic programs of higher dimensions. Journal of Mathematical Analysis and Applications 48 (1974) 801-810
7. Bretthauer K.M., Shetty B., Syam S., and White S. A model for resource constrained production and inventory management. Decision Sciences 25 (1997) 561-580
8. Smith S., and Lasdon L. Solving large sparse nonlinear programs using GRG. ORSA Journal on Computing 4 (1992) 2-15
9. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), Wiley, New York
10. Ibaraki T., and Katoh N. Resource Allocation Problems (1988), MIT Press, Cambridge, MA
11. Hochbaum D.S. Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Mathematics of Operations Research 19 (1994) 390-409
12. Bretthauer K.M., and Shetty B. A pegging algorithm for the nonlinear resource allocation problem. Computers and Operations Research 29 5 (2001) 505-527
13. Bretthauer K.M., and Shetty B. The nonlinear knapsack problem; algorithms and applications. European Journal of Operational Research 138 (2002) 459-472
14. Kozanidis G., and Melachrinoudis E. A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints. Computers and Operations Research 31 5 (2004) 695-711
15. Li V.C., and Curry G.L. Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. Computers and Operations Research 32 4 (2005) 825-848
16. Vincent C.L. Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints. Computers and Operations Research 32 11 (2005) 2843-2852