New convergent heuristics for 0-1 mixed integer programming

European Journal of Operational Research

Volumn 195, Issue 1, 2009, Pages 62-74

  Wilbaut, Christophe ^a   Hanafi, Said ^a  

^a UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

0 1 Mixed integer programming; Heuristic; Multidimensional Knapsack problem; Relaxation

Indexed keywords

ALGORITHMS; CONTROL THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; LINEAR PROGRAMMING; LINEARIZATION; PARTICLE SIZE ANALYSIS; PLASMA WAVES;

0-1 MIXED INTEGER PROGRAMMING; CONVERGENT ALGORITHMS; HEURISTIC; HYBRID HEURISTICS; HYBRID METHODS; LOWER BOUNDS; MIXED INTEGER PROGRAMMING PROBLEMS; MIXED INTEGER PROGRAMMINGS; MULTIDIMENSIONAL KNAPSACK PROBLEM; MULTIDIMENSIONAL KNAPSACK PROBLEMS; OPTIMAL VALUES; RELAXATION; SEARCH PROCESSES; UPPER BOUNDS;

INTEGER PROGRAMMING;

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

References (27)

1. Ahuja R.K., Ergun O., Orlin J.B., and Punnen A.P. Survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123 (2002) 75-102
2. Balas E., and Jeroslow R. Canonical cuts on the unit hypercube. SIAM Journal on Applied Mathematics 23 1 (1972) 61-69
3. Beasley J.E. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 11 (1990) 1069-1072
4. Danna E., Rothberg E., and Le Pape C. Exploring relaxations induced neighborhoods to improve MIP solutions. Mathematical Programming 102 A (2005) 71-90
5. Fischetti M., and Lodi A. Local branching. Mathematical Programming 98 B (2003) 23-47
6. Fréville A. The multidimensional 0-1 Knapsack problem: An overview. European Journal of Operational Research 155 1 (2004) 1-21
7. Fréville A., and Plateau G. An efficient preprocessing procedure for the multidimensional Knapsack problem. Discrete Applied Mathematics 49 (1994) 189-212
8. Fréville A., and Hanafi S. The multidimensional 0-1 Knapsack problem - bounds and computational aspects. Annals of Operations Research 139 1 (2005) 195-227
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
10. Glover F. Adaptive memory projection methods for integer programming. In: Rego C., and Alidaee B. (Eds). Metaheuristic Optimization Via Memory and Evolution (2005), Kluwer Academic Publishers 425-440
11. Glover F., and Kochenberger G. Critical event tabu search for multidimensional Knapsack problems. In: Osman I., and Kelly J. (Eds). Meta Heuristics: Theory and Applications (1996), Kluwer Academic Publishers 407-427
12. Guignard, M., Spielberg, K., 2003. Double contraction, double probing, short starts and BB-probing cuts for mixed (0, 1) programming, Technical Report, Wharton School.
13. Hanafi, S., Wilbaut, C., 2006. Improved convergent heuristic for the 0-1 multidimensional Knapsack problem, Technical Report, University of Valenciennes, France.
14. Hanafi S., and Glover F. Exploiting nested inequalities and surrogate constraints. European Journal of Operational Research 179 1 (2007) 50-63
15. Hansen P., Mladenovic N., and Urosevic D. Variable neighbourhood search and local branching. Computers and Operations Research 33 10 (2006) 3034-3045
16. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer
17. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1999), Willey-Interscience, New York
18. Osario M.A., Glover F., and Hammer P. Cutting and surrogate constraint analysis for improved multidimensional Knapsack solutions. Annals of Operations Research 117 (2002) 71-93
19. Pedroso, J.P., 2004. Tabu search for mixed integer programming, Technical Report, DCC-2004-02, University of Porto, Portugal.
20. Puchinger, J., Raidl, G.R., 2005. Relaxation guided variable neighborhood search. In: Proceedings of the XVIII Mini EURO Conference on VNS, Tenerife, Spain.
21. Shaw, P., 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: The 4th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 1520. pp. 417-431.
22. Soyster A.L., Lev B., and Slivka W. Zero-one programming with many variables and few constraints. European Journal of Operational Research 2 (1978) 195-201
23. Spielberg, K., Guignard, M., 2000. A sequential (quasi) hot start method for BB (0, 1) mixed integer programming. In: Mathematical Programming Symposium, Atlanta.
24. Vasquez M., and Hao J.K. Une approche hybride pour le sac à dos multidimensionnel en variables 0-1. RAIRO Operations Research 35 (2001) 415-438
25. Vasquez M., and Vimont Y. Improved results on the 0-1 multidimensional Knapsack problem. European Journal of Operational Research 165 (2005) 70-81
26. Wilbaut, C., 2006. Heuristiques hybrides pour la résolution de problèmes en nombres entiers mixtes, PhD Thesis, Université de Valenciennes et du Hainaut Cambrésis.
27. Wilbaut C., Hanafi S., Fréville A., and Balev S. Tabu search: Global intensification using dynamic programming. Control and Cybernetic 35 3 (2006) 579-598