CP-based local branching

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

Volumn 4741 LNCS, Issue , 2007, Pages 847-855

  Kiziltan, Zeynep ^a   Lodi, Andrea ^a   Milano, Michela ^a   Parisini, Fabio ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; SEARCH ENGINES;

CONSTRAINT PROGRAMMING (CP); MIXED INTEGER PROGRAMMING (MIP);

HEURISTIC PROGRAMMING;

EID: 38149031766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_63     Document Type: Conference Paper

References (7)

1. Harvey, W., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI-95, pp. 607-615. Morgan Kaufmann, San Francisco (1995)
2. Fischetti, M., Lodi, A.: Local branching. Math. Prog. 98, 23-47 (2003)
3. Fischetti, M., Toth, P.: An additive bounding procedure for combinatorial optimization problems. Oper. Res. 37, 319-328 (1989)
4. Focacci, F., Lodi, A., Milano, M.: Optimization-oriented global constraints. Constraints 7, 351-365 (2002)
5. Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. on Comp. 14(4), 403-417 (2002)
6. Kiziltan, Z., Lodi, A., Milano, M., Parisini, F.: CP-based Local Branching. Technical Report OR/07/8, University of Bologna (2007)
7. Lodi, A., Milano, M., Rousseau, L.M.: Discrepancy based additive bounding for the alldifferent constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 510-524. Springer, Heidelberg (2003)