Alessandro Zanarini and Gilles Pesant
Article (2009)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/18788/ |
| Journal Title: | Constraints (vol. 14, no. 3) |
| Publisher: | Springer |
| DOI: | 10.1007/s10601-008-9065-9 |
| Official URL: | https://doi.org/10.1007/s10601-008-9065-9 |
| Date Deposited: | 18 Apr 2023 15:15 |
| Last Modified: | 25 Sep 2024 15:56 |
| Cite in APA 7: | Zanarini, A., & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. https://doi.org/10.1007/s10601-008-9065-9 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
