![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Constraint-Based Combinators for Local Search."
@article{DBLP:journals/constraints/HentenryckML05, author = {Pascal Van Hentenryck and Laurent Michel and Liyuan Liu}, title = {Contraint-Based Combinators for Local Search}, journal = {Constraints An Int. J.}, volume = {10}, number = {4}, pages = {363--384}, year = {2005}, url = {https://doi.org/10.1007/s10601-005-2811-3}, doi = {10.1007/S10601-005-2811-3}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/constraints/HentenryckML05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cp/HentenryckML04, author = {Pascal Van Hentenryck and Laurent Michel and Liyuan Liu}, editor = {Mark Wallace}, title = {Constraint-Based Combinators for Local Search}, booktitle = {Principles and Practice of Constraint Programming - {CP} 2004, 10th International Conference, {CP} 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3258}, pages = {47--61}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30201-8\_7}, doi = {10.1007/978-3-540-30201-8\_7}, timestamp = {Fri, 27 Mar 2020 09:00:36 +0100}, biburl = {https://dblp.org/rec/conf/cp/HentenryckML04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.