Advertisement

Annals of Operations Research

, Volume 115, Issue 1–4, pp 73–93 | Cite as

Cost Based Filtering for the Constrained Knapsack Problem

  • Torsten Fahle
  • Meinolf Sellmann
Article

Abstract

We present cost based filtering methods for Knapsack Problems (KPs). Cost based filtering aims at fixing variables with respect to the objective function. It is an important technique when solving complex problems such as Quadratic Knapsack Problems, or KPs with additional constraints (Constrained Knapsack Problems (CKPs)). They evolve, e.g., when Constraint Based Column Generation is applied to appropriate optimization problems. We develop new reduction algorithms for KP. They are used as propagation routines for the CKP with Θ(nlog n) preprocessing time and Θ(n) time per call. This sums up to an amortized time Θ(n) for Ω(log n) incremental calls where the subsequent problems may differ with respect to arbitrary sets of necessarily included and excluded items.

constraint programming constrained knapsack problems cost based filtering optimization constraints reduction algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Balas and E. Zemel, An algorithm for large-scale zero-one knapsack problems, Operations Research 28 (1980) 119-148.Google Scholar
  2. [2]
    A. Caprara, D. Pisinger and P. Toth, Exact solution of the Quadratic Knapsack Problem, INFORMS Journal on Computing 11 (1999) 125-137.Google Scholar
  3. [3]
    C. Chu and J. Antonio, Approximation algorithm to solve real-life multicriteria cutting stock problems, Operations Research 47(4) (1999) 495-508.Google Scholar
  4. [4]
    G.B. Dantzig, Discrete variable extremum problems, Operations Research 5 (1957) 266-277.Google Scholar
  5. [5]
    R.S. Dembo and P.L. Hammer, A reduction algorithm for knapsack problems, Methods of Operations Research 36 (1980) 49-60.Google Scholar
  6. [6]
    T. Fahle, U. Junker, S.E. Karisch, N. Kohl, M. Sellmann and B. Vaaben, Constraint programming based column generation for crew assignment, Journal of Heuristics 8 (2002) 59-81.Google Scholar
  7. [7]
    D. Fayard and G. Plateau, An algorithm for the solution of the 0-1 knapsack problem, Computing 28 (1983) 269-287.Google Scholar
  8. [8]
    F. Focacci, A. Lodi and M. Milano, Cost-based domain filtering, in: Proceedings of the CP'99, Lecture Notes in Computer Science, Vol. 1713 (Springer, Berlin, 1999) pp. 189-203.Google Scholar
  9. [9]
    F. Focacci, A. Lodi and M. Milano, Cutting planes in Constraint Programming: A hybrid approach, in: Proceedings of the CP-AI-OR'00 (2000) pp. 45-51.Google Scholar
  10. [10]
    P.D. Hudson, Improving the branch and bound algorithm for the knapsack problem, Queen's University Research Report, Belfast (1977).Google Scholar
  11. [11]
    ILOG, ILOG SOLVER, Reference manual and user manual, V5.0, ILOG (2000).Google Scholar
  12. [12]
    G.P. Ingargiola and J.F. Korsh, A reduction algorithm for zero-one single knapsack problems, Management Science 20 (1973) 460-463.Google Scholar
  13. [13]
    U. Junker, S.E. Karisch, N. Kohl, B. Vaaben, T. Fahle and M. Sellmann, A Framework for Constraint programming based column generation, in: Proceedings of the CP'99, Lecture Notes in Computer Science, Vol. 1713 (Springer, Berlin, 1999) pp. 261-274.Google Scholar
  14. [14]
    S. Martello, D. Pisinger and P. Toth, Dynamic programming and tight bounds for the 0-1 knapsack problem, Management Science 45 (1999) 414-424.Google Scholar
  15. [15]
    S. Martello and P. Toth, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, European Journal of Operational Research 1 (1977) 169-175.Google Scholar
  16. [16]
    S. Martello and P. Toth, A new algorithm for the 0-1 knapsack problem, Management Science 34 (1988) 633-644.Google Scholar
  17. [17]
    S. Martello and P. Toth, Upper Bounds and Algorithms for hard 0-1 knapsack problems, Operations Research 45(5) (1997) 768-778.Google Scholar
  18. [18]
    S. Martello and P. Toth, Knapsack Problems-Algorithms and Computer Implementations (Wiley Interscience, New York, 1990).Google Scholar
  19. [19]
    G. Ottosson and E.S. Thorsteinsson, Linear relaxation and reduced-cost based propagation of continuous variable subscripts, in: Proceedings of the CP-AI-OR'00 (2000) pp. 129-138.Google Scholar
  20. [20]
    D. Pisinger, An expanding-core algorithm for the exact 0-1 knapsack problem, European Journal of Operational Research 87 (1995) 175-187.Google Scholar
  21. [21]
    D. Pisinger, An exact algorithm for large multiple knapsack problem, European Journal of Operational Research 114 (1999) 528-541.Google Scholar
  22. [22]
    O. Porto, M. de Moraes and A. Lucena, A relax and cut algorithm for the quadratic knapsack problem, in: Proceedings of the ISMP'00, 17th International Symposium on Mathematical Programming, Atlanta (2000).Google Scholar
  23. [23]
    J.-C. Régin, A filtering algorithm for constraints of difference in CSPs, in: Proc. of the 12th National Conference on Artificial Intelligence (AAAI-94) (1994) pp. 362-367.Google Scholar
  24. [24]
    M. Sellmann and T. Fahle, Constraint programming based Lagrangian relaxation for a multimedia application, in: Proceedings CP-AI-OR'01, Ashford/UK (April 2001).Google Scholar
  25. [25]
    M. Sellmann and T. Fahle, Coupling variable fixing algorithms for the automatic recording problem, in: 9th Annual European Symposium on Algorithms (ESA 2001), Lecture Notes in Computer Science, Vol. 2161 (Springer, Berlin, 2001) pp. 134-145.Google Scholar
  26. [26]
    M. Trick, A dynamic programming approach for consistency and propagation for knapsack constraints, in: Proceedings of CP-AI-OR'01, Ashford/UK (April, 2001).Google Scholar
  27. [27]
    P.R.C. Villela and C.T. Bornstein, An improved bound for the 0-1 knapsack problem, Report ES31-83, COPPE-Federal University of Rio de Janeiro (1983).Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Torsten Fahle
    • 1
  • Meinolf Sellmann
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations