Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem

Computers and Operations Research

Volumn 34, Issue 9, 2007, Pages 2657-2673

  Hifi, M ^a   Michrafy, M ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Branch and bound; Combinatorial optimization; Dichotomous search; Knapsacks; Reduction strategies; Valid cuts

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; DICHOTOMOUS SEARCH; DISJUNCTIVELY CONSTRAINED KNAPSACK PROBLEM (DCKP); REDUCTION STRATEGIES;

PROBLEM SOLVING;

EID: 33846610128     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.10.004     Document Type: Article

References (14)

1. Balas E., and Zemel E. An algorithm for large zero-one knapsack problem. Operations Research 28 (1980) 1130-1154
2. Fayard D., and Plateau G. An algorithm for the solution of the 0-1 knapsack problem. Computing 28 (1982) 269-287
3. Gilmore P.C., and Gomory R.E. Multistage cutting problems of two and more dimensions. Operations Research 13 (1965) 94-119
4. Gilmore P.C., and Gomory R.E. The theory and computation of knapsack functions. Operations Research 14 (1966) 1045-1074
5. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin
6. Martello S., and Toth P. Knapsack problems: algorithms and computer implementations (1990), Wiley, New York
7. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman and Company, San Francisco
8. Martello S., Pisinger D., and Toth P. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45 (1999) 414-424
9. Pisinger D, Sigurd MM. Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. Technical Report 03/1, Department of Computer Science, University of Copenhagen, Denmark; 2003.
10. Yamada T, Kataoka S. Heuristic and exact algorithms for the disjunctively constrained knapsack problem. EURO 2001, Rotterdam, The Netherlands; July 9-11, 2001.
11. Yamada T., Kataoka S., and Watanabe K. Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Information Processing Society of Japan Journal 43/9 (2002) 2864-2870
12. Hifi M, Michrafy M. A reactive local search-based algorithm for the disjunctively constrained knapsack problem. Journal of the Operational Research Society, to appear.
13. Wolsey L.A. Integer programming (1998), Wiley, New York
14. Dantzig G.B. Discrete variable extremum problems. Operations Research 5 (1957) 266-277