A reactive local search-based algorithm for the disjunctively constrained knapsack problem

Journal of the Operational Research Society

Volumn 57, Issue 6, 2006, Pages 718-726

  Hifi, M ^a,b   Michrafy, M ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Combinatorial optimization; Heuristics; Knapsacks; Reactive local search

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; KNAPSACKS; REACTIVE LOCAL SEARCH;

COMBINATORIAL MATHEMATICS;

EID: 33745800687     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602046     Document Type: Article

References (18)

1. Balas E and Zemel E (1980). An algorithm for large zero-one knapsack problems. Op Res 28: 1130-1154.
2. Fayard D and Plateau G (1982). An algorithm for the solution of the 0-1 knapsack problem. Computing 28: 269-287.
3. Freville A and Plateau G (1994). An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discrete Appl Mathe 49: 189-212.
4. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company: San Francisco.
5. Gilmore PC and Gomory RE (1965). Multistage cutting problems of two and more dimensions. Opns Res 13: 94-119.
6. Gilmore PC and Gomory RE (1966). The theory and computation of knapsack functions. Opns Res 14: 1045-1074.
7. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comp Opns Res 13: 533-549.
8. Hansen P (1986). The steepest ascent mildest descent heuristic for combinatorial programming. Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
9. Hifi M, Michrafy M and Sbihi A (2004). Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J Opl Res Soc 55: 1323-1332.
10. Ibaraki T and Fukushima M (1991). Fortran77 Optimization Programming, Iwanami: Tokyo (in Jananese).
11. Kellerer H, Pferschy U and Pisinger D (2004). Knapsack Problems. Springer: Berlin.
12. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley: Chichester, England.
13. Martello S, Pisinger D and Toth P (1999). Dynamic programming and strong bounds for the 0-1 knapsack problem. Mngt Sci 45: 414-424.
14. Moser M, Jokanović DP and Shiratori N (1997). An algorithm for the multidimensional multiple-choice knapsack problem. IEECE Tran Fund Electron 80: 582-589.
15. Pisinger D (1995). A minimal algorithm for the multiple-choice knapsack problem. Eur J Opnl Res 83: 394-410.
16. Richardson J, Palmer M, Liepins G and Hilliard M (1989). Some guidelines for genetic algorithms with penalty functions. In: Schaffer J (ed). Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, Los Athos, CA, pp 191-197.
17. Yamada T and Kataoka S (2001). Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Presented at EURO 2001. Rotterdam, The Netherlands, July 9-11.
18. Yamada T, Kataoka S and Watanabe K (2002). Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Inform Process Soc Jpn J 43: 2864-2870.