Fabio Parisini, Michela Milano. Improving CP-based local branching via sliced neighborhood search. In William C. Chu, W. Eric Wong, Mathew J. Palakal, Chih-Cheng Hung, editors, Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21 - 24, 2011. pages 887-892, ACM, 2011. [doi]
@inproceedings{ParisiniM11,
title = {Improving CP-based local branching via sliced neighborhood search},
author = {Fabio Parisini and Michela Milano},
year = {2011},
doi = {10.1145/1982185.1982380},
url = {http://doi.acm.org/10.1145/1982185.1982380},
tags = {rule-based, slicing, search},
researchr = {https://researchr.org/publication/ParisiniM11},
cites = {0},
citedby = {0},
pages = {887-892},
booktitle = {Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21 - 24, 2011},
editor = {William C. Chu and W. Eric Wong and Mathew J. Palakal and Chih-Cheng Hung},
publisher = {ACM},
isbn = {978-1-4503-0113-8},
}