Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization

European Journal of Operational Research

Volumn 236, Issue 2, 2014, Pages 488-498

  Srivastava, Vaibhav ^a   Bullo, Francesco ^b  

^a Princeton University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bin packing problem; Generalized assignment problem; Human attention allocation; Knapsack problem; Multi choice knapsack problem; Sigmoid utility S curve

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; OPTIMIZATION;

BIN PACKING PROBLEM; GENERALIZED ASSIGNMENT PROBLEM; HUMAN ATTENTION; KNAPSACK PROBLEMS; SIGMOID UTILITY/S-CURVE;

APPROXIMATION ALGORITHMS;

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

References (35)

1. S. Aǧrali, and J. Geunes Solving knapsack problems with S-curve return functions European Journal of Operational Research 193 2 2009 605 615
2. Bertuccelli, L. F.; Beckers, N. W. M.; Cummings, M. L. (2010). Developing operator models for UAV search scheduling. In AIAA conf. on guidance, navigation and control, Toronto, Canada, August 2010.
3. R. Bogacz, E. Brown, J. Moehlis, P. Holmes, and J.D. Cohen The physics of optimal decision making: A formal analysis of performance in two-alternative forced choice tasks Psychological Review 113 4 2006 700 765
4. K.M. Bretthauer, and B. Shetty The nonlinear knapsack problem-algorithms and applications European Journal of Operational Research 138 3 2002 459 472
5. W.M. Bulkeley Chicago's camera network is everywhere The Wall Street Journal 2009
6. G.J. Burke, J. Geunes, H.E. Romeijn, and A. Vakharia Allocating procurement to capacitated suppliers with concave quantity discounts Operations Research Letters 36 1 2008 103 109
7. J. Calvin Convergence rate of the P-algorithm for optimization of continuous functions P.M. Pardalos, Approximation and complexity in numerical optimization: Continuous and discrete problems 1999 Kluwer Academic
8. J. Calvin, and A. Žilinskas On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions Journal of Optimization Theory and Applications 102 3 1999 479 495
9. R. Cohen, L. Katzir, and D. Raz An efficient approximation for the generalized assignment problem Information Processing Letters 100 4 2006 162 166
10. Drew, C. (2010). Military taps social networking skills (June 7). The New York Times.
11. J.R. Freeland, and C.B. Weinberg S-Shaped response functions: Implications for decision models Journal of the Operational Research Society 31 11 1980 1001 1007
12. W. Ginsberg The multiplant firm with increasing returns to scale Journal of Economic Theory 9 3 1974 283 292
13. E. Guizzo Obama commanding robot revolution announces major robotics initiative IEEE Spectrum 2011
14. P. Hansen, B. Jaumard, and S.H. Lu Global optimization of univariate Lipschitz functions: I. Survey and properties Mathematical Programming 55 1 1992 251 272
15. J.B. Hiriart-Urruty On optimality conditions in nondifferentiable programming Mathematical Programming 14 1 1978 73 86
16. S.K. Hong, and C.G. Drury Sensitivity and validity of visual search models for multiple targets Theoretical Issues in Ergonomics Science 3 1 2002 85 110
17. T. Ibaraki, and N. Katoh Resource allocation problems: Algorithmic approaches 1988 MIT Press
18. S. Kameshwaran, and Y. Narahari Nonconvex piecewise linear knapsack problems European Journal of Operational Research 192 1 2009 56 68
19. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack Problems 2004 Springer
20. B. Korte, and J. Vygen Combinatorial optimization: Theory and algorithms 4th ed. Algorithmics and combinatorics Vol. 21 2007 Springer
21. H.J. Kushner A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise Journal of Basic Engineering 86 1 1964 97 106
22. D.G. Luenberger Linear and nonlinear programming 2nd ed. 1984 Addison-Wesley
23. S. Martello, and P. Toth Knapsack problems: Algorithms and computer implementations 1990 Wiley
24. J.J. Moré, and S.A. Vavasis On the solution of concave knapsack problems Mathematical Programming 49 1 1990 397 411
25. R.W. Pew The speed-accuracy operating characteristic Acta Psychologica 30 1969 16 26
26. A.G. Rao, and M.R. Rao Optimal budget allocation when response is S-shaped Operations Research Letters 2 5 1983 225 230
27. R.T. Rockafellar Lagrange multipliers and optimality SIAM Review 35 2 1993 183 238
28. M.H. Rothkopf Bidding in simultaneous auctions with a constraint on exposure Operations Research 25 4 1977 620 629
29. Shanker, T.; & Richtel, M. (2011). In new military, data overload can be deadly (January 16). The New York Times.
30. Southern, D. N. (2010). Human-guided management of collaborating unmanned vehicles in degraded communication environments. Master's thesis (May 2010). Electrical Engineering and Computer Science, Massachusetts Institute of Technology.
31. Srivastava V. & Bullo F. (2011). Hybrid combinatorial optimization: Sample problems and algorithms. In IEEE Conf. on Decision and Control and European Control Conference, Orlando, FL, USA, December 2011 (pp. 7212-7217).
32. Srivastava, V.; Carli, R.; Bullo, F.; & Langbort, C. (2011). Task release control for decision making queues. In American control conference, San Francisco, CA, USA, June 2011 (pp. 1855-1860).
33. Srivastava, V.; Carli, R.; Langbort, C.; & Bullo, F. (2012). Attention allocation for decision making queues. Automatica (in press). http://dx.doi.org/10.1016/j.automatica.2013.11.028.
34. D. Vakratsas, F.M. Feinberg, F.M. Bass, and G. Kalyanaram The shape of advertising response functions revisited: A model of dynamic probabilistic thresholds Marketing Science 23 1 2004 109 119
35. C.D. Wickens, and J.G. Hollands Engineering psychology and human performance 3rd ed. 2000 Prentice Hall