Nonconvex piecewise linear knapsack problems

European Journal of Operational Research

Volumn 192, Issue 1, 2009, Pages 56-68

  Kameshwaran, S ^a   Narahari, Y ^b  

^a INDIAN SCHOOL OF BUSINESS   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Approximation algorithm; Convex envelope; Dynamic programming; Fully polynomial time approximation scheme; Linear relaxation; Multiple choice knapsack problem; Piecewise linear knapsack problem; Precedence constrained knapsack problem

Indexed keywords

APPROXIMATION ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; SUPPLY CHAINS; SYSTEMS ENGINEERING; VIBRATIONS (MECHANICAL); WIRELESS LOCAL AREA NETWORKS (WLAN);

APPLICATIONS.; APPROXIMATION ALGORITHM; COMPUTATIONAL EXPERIMENTS; CONVEX ENVELOPE; CONVEX ENVELOPES; COST STRUCTURES; FULLY POLYNOMIAL TIME APPROXIMATION SCHEME; KNAPSACK PROBLEMS; LINEAR RELAXATION; MANUFACTURING PLANNING; MIXED-INTEGER LINEAR PROGRAMMING; MULTIPLE CHOICE KNAPSACK PROBLEM; NONCONVEX; OPTIMAL QUANTITY; OPTIMIZ ATION PROBLEMS; PIECE-WISE LINEAR; PIECE-WISE LINEAR FUNCTIONS; PIECEWISE LINEAR KNAPSACK PROBLEM; POLYNOMIAL-TIME; POLYNOMIAL-TIME DYNAMIC PROGRAMMING; PRECEDENCE CONSTRAINED KNAPSACK PROBLEM; PROBLEM INSTANCES; PROCUREMENT AUCTIONS; SUPPLY CHAIN DESIGNS; TEST SUITES; TOTAL COSTS;

POLYNOMIAL APPROXIMATION;

EID: 50849121684     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.08.044     Document Type: Article

References (33)

1. Bellman R.E. Dynamic Programming (1957), Princeton University Press, Princeton, NJ
2. Bitran G.R., and Hax A.C. Disaggregation and resource allocation using convex knapsack problems with bounded variables. Management Science 27 (1981) 431-441
3. Bretthauer K.M., and Shetty B. The nonlinear resource allocation problem. Operations Research 43 (1995) 670-683
4. Bretthauer K.M., and Shetty B. A pegging algorithm for the nonlinear resource allocation problem. Computers and Operations Research 29 5 (2001) 505-527
5. Bretthauer K.M., and Shetty B. The nonlinear knapsack problem - algorithms and applications. European Journal of Operations Research 138 (2002) 459-472
6. K.L. Croxton, Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management, PhD thesis, Operations Research Center, MIT, Cambridge, MA, 1999.
7. Croxton K.L., Gendron B., and Magnanti T.L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science 49 9 (2003) 1268-1273
8. A. Davenport, J. Kalagnanam, Price negotiations for procurement of direct inputs, Research Report RC 22078, IBM Research, Yorktown Heights, NJ, USA, 2001.
9. Dudziński K., and Walukiewicz S. Exact methods for the knapsack problem and its generalizations. European Journal of Operational Research 28 (1987) 3-21
10. Eso M., Ghosh S., Kalagnanam J., and Ladanyi L. Bid evaluation in procurement auctions with piecewise linear supply curves. Journal of Heuristics 11 (2005) 147-173
11. Floyd R. Algorithm 245: Treesort3. Communications of the ACM 7 12 (1964) 701
12. Gens G.V., and Levner E.V. Computational complexity of approximation algorithms for combinatorial problems. Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 74 (1979), Springer 292-300
13. Güntzer M.M., and Jungnickel D. Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem. Operations Research Letters 26 (2000) 55-66
14. Hochbaum D.S. A nonlinear knapsack problem. Operations Research Letters 17 (1995) 103-110
15. Hochbaum D.S. Various notions of approximations: Good, better, best, and more. In: Hochbaum D.S. (Ed). Approximation algorithms for NP-hard problems (1995), PWS Publishing Company 346-398
16. Horst R., and Tuy H. Global Optimization: Deterministic Approaches (1990), Springer, Berlin
17. Ibaraki T., and Katoh N. Resource Allocation Problems: Algorithmic Approaches (1988), MIT Press, Cambridge, MA
18. Ibarra O.H., and Kim C.E. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22 (1975) 463-468
19. Johnson D.S., and Niemi K.A. On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research 8 (1983) 1-14
20. S. Kameshwaran, Algorithms for piecewise linear knapsack problems with applications in electronic commerce. PhD thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 2004.
21. Kameshwaran S., Narahari Y., Rosa C.H., Kulkarni D.M., and Tew J.D. Multiattribute electronic procurement using goal programming. European Journal of Operational Research 179 (2007) 518-536
22. Kodialam M.S., and Luss H. Algorithms for separable nonlinear resource allocation problems. Operational Research 46 (1998) 272-284
23. A. Kothari, D. Parkes, and S. Suri, Approximately strategy proof and tractable multi-unit auctions, in: Proceedings of ACM Conference on Electronic Commerce (EC-03), 2003.
24. D.S. Kung, The multiple choice knapsack problem: Algorithms and applications, PhD thesis, University of Texas, Austin, 1982.
25. Labbé M., Schmeichel E.F., and Hakimi S.L. Approximation algorithms for the capacitated plant allocation problem. Operations Research Letters 15 (1994) 115-126
26. Lawler E.L. Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 (1979) 339-356
27. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementation (1990), John Wiley and Sons
28. Mathur K., Salkin H.M., and Mohanty B.B. A note on a general non-linear knapsack problems. Operations Research Letters 5 (1986) 79-81
29. Moré J.J., and Vavasis S.A. On the solution of concave knapsack problems. Mathematical Programming 49 (1991) 397-411
30. Pisinger D., and Toth P. Knapsack problems. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publications 299-428
31. Sahni S. Approximate algorithms for the 0-1 knapsack problem. Journal of the ACM 22 (1975) 115-124
32. Samphaiboon N., and Yamada T. Heuristic and exact algorithms for the precedence constrained knapsack problem. Journal of Optimization Theory and Applications 105 (2000) 659-676
33. Zipkin P.H. Simple ranking methods for allocation of one resource. Management Science 26 (1980) 34-43