A pre-processing aware RINS based MIP heuristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7919 LNCS, Issue , 2013, Pages 1-11

  Gomes, Thiago M ^a   Santos, Haroldo G ^a   Souza, Marcone J F ^a  

^a FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROLLED SIZE; NUMBER OF FIXATIONS; OPEN SOURCES; PRE-PROCESSING; STOPPING CRITERIA; SUB-PROBLEMS; VARIABLE NEIGHBORHOOD DESCENTS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

HEURISTIC ALGORITHMS;

EID: 84882957743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38516-2_1     Document Type: Conference Paper

References (20)

1. Glover, F.: Tabu Search and adaptive memory programming - advances, applications and challenges. In: Interfaces in Computer Sciences and Operations Research, pp. 1-75 (1996)
2. Reeves, C.R.: Genetic Algorithms Modern Heuristic Techniques for Combinatorial Problems. Advanced Topics in Computer Science Series, ch. 4, pp. 151-196. Blackwell Scientific Publications (1993)
3. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)
4. Glover, F.: Future paths for Integer Programming and links to Artificial Intelligence. COR 13(5), 533-549 (1986)
5. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11, 4135-4151 (2011)
6. Eckstein, J., Nediak, M.: Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. Journal Heuristics 13, 471-503 (2007)
7. Parisini, F., Milano, M.: Improving CP-based Local Branching via Sliced Neighborhood Search. In: Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 887-892 (2011)
8. Ghosh, S.: DINS, a MIP Improvement Heuristic. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 310-323. Springer, Heidelberg (2007)
9. Berthold, T.: Rens: The Relaxation Enforced Neighborhood Search (2009)
10. Ferreira, D., Morabito, R., Rangel, S.: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Computers and Operations Research 37, 684-691 (2009)
11. Danna, E., Rothberg, E., Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions 102, 71-90 (2005)
12. Fischetti, M., Bertacco, L., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Technical report, Università di Bologna D.E.I.S. Operations Research (2005)
13. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Mathematical Programming 104(1), 9104 (2005)
14. Fischetti, M., Lodi, A.: Local branching. Mathematics Programming, ser. B 98, 23-47 (2003)
15. Rothberg, E.: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions. INFORMS Journal on Computing 19(4), 534-541 (2007)
16. Forrest, J., Lougee-Heimer, R.: INFORMS Tutorials in Operations Research. CBC User Guide, pp. 257-277 (2005)
17. Lougee-Heimer, R.: The Common Optimization Interface for Operations Research: Promoting open-source software in the operations research community. IBM Journal of Research and Development 47(1), 57-66 (2003)
18. Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097-1100 (1997)
19. Haspeslagh, S., De Causmaecker, P., Stolevik, M., Schaerf, A.: First international nurse rostering competition 2010. CODeS, Department of Computer Science. KULeuven Campus Kortrijk, Belgium (2010)
20. Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D., Wolter, K.: MIPLIB 2010. Mathematical Programming Computation. Mathematics and Statistics 3, 103-163 (2011), http://dx.doi.org/10.1007/s12532-011-0025-9