Skip to main content
Conference Proceedings

CP-based local branching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4741 LNCS 847-855
DOI: 10.1007/978-3-540-74970-7_63
11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Local branching is a general purpose heuristic search method successfully used in Mixed Integer Programming (MIP). We propose its integration and extension in Constraint Programming (CP). © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kiziltan, Z., Lodi, A., Milano, M., & Parisini, F. (2007). CP-based local branching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 847–855). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free