Integer knapsack problems with set-up weights

Computational Optimization and Applications

Volumn 37, Issue 1, 2007, Pages 35-47

  McLay, Laura A ^a   Jacobson, Sheldon H ^b  

^a VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Fully polynomial time approximation schemes; Heuristics; Knapsack problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

AVIATION SECURITY; DYNAMIC PROGRAMMING ALGORITHMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; KNAPSACK PROBLEMS;

INTEGER PROGRAMMING;

EID: 34047179030     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9020-5     Document Type: Article

References (16)

1. Boissonnat, J.-D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, Cambridge (1998)
2. Bruno, J., Downey, P.: Complexity of task scheduling with deadlines, set-up times and changeover costs. SIAM J. Comput. 7(4), 393-404 (1978)
3. Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2), 333-345 (2000)
4. Chajakis, E.D., Guignard, M.: Exact algorithms for the setup knapsack problem. INFOR 32(3), 124-142 (1994)
5. Ibarra, O.H., Kim, C.E.: Approximation algorithms for certain scheduling problems. Math. Oper. Res. 3(3), 197-204 (1978)
6. Johnson, D.S., Niemi, K.A.: On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8(1), 1-14 (1983)
7. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
8. Lawler, E.L., Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339-356 (1979)
9. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
10. McLay, L.A., Jacobson, S.H.: Integer knapsack problems with set-up weights. Technical report, University of Illinois, Urbana (2005)
11. McLay, L.A., Jacobson, S.H., Kobza, J.E.: A multilevel passenger screening problem for aviation security. Nav. Res. Log. 53(3), 183-197 (2006)
12. Park, K., Park, S.: Lifting cover inequalities for the precedence-constrained knapsack problem. Discret. Appl. Math. 72, 219-241 (1997)
13. Pferschy, U., Pisinger, D., Woeginger, G.J.: Simple but efficient approaches for the collapsing knapsack problem. Discret. Appl. Math. 77, 271-280 (1997)
14. Pisinger, D.: A fast algorithm for strongly correlated knapsack problems. Discret. Appl. Math. 89, 197-212 (1998)
15. Süral, H., van Wassenhove, L.N., Potts, C.N.: The bounded knapsack problem with setups. Technical report, INSEAD, Centre for the Management of Environmental Resources, Report 97/71/TM, France (1997)
16. Yang, W.H., Liao, C.J.: Survey of scheduling research involving setup times. Int. J. Systems Sci. 30(2), 143-155 (1999)