Constraint Programming

1. Exponential Propagation for Set Variables. J. Yip and P. Van Hentenryck. In 16th International Conference on Principles and Practice of Constraint Programming 2010 (CP 2010), St Andrews, Scotland, September 2010.
   

2.   Domain Consistency with Forbidden Values. Y. Deville and P. Van Hentenryck.In 16th International Conference on Principles and Practice of Constraint Programming 2010 (CP 2010), St Andrews, Scotland, September 2010.
   

3. Boosting Set Constraint Propagation for Network Design.  J. Yip, P. Van Hentenryck, and C. Gervet.Proceedings of the Sixth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'10), Bologna, Italy, 2010.
   

4. Revisiting the Soft Global Cardinality Constraint. P. Schaus, P. Van Hentenryck, and A. Zanarini.  Proceedings of the Sixth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'10), Bologna, Italy, 2010.
   

5. Dynamic structural symmetry breaking for constraint satisfaction problems. P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck and M. Aegren. Constraints 14(4): 506-538 (2009).
   

6. Model-Driven Visualizations of Constraint-Based Local Search.  G. Dooms, P. Van Hentenryck and L. Michel.  Constraints, 14(3), September 2009.
   

7. Transparent Parallelization of Constraint Programming. L. Michel, A. See, and P. Van Hentenryck. INFORMS Journal on Computing, 21(3), 363–382, Summer 2009.
   

8. Parallel and Distributed Local Search in Comet. Computers and Operations Research, L. Michel, A. See, and P. Van Hentenryck. 36(8), August 2009.
   

9. Just-In-Time Scheduling with Constraint Programming, J.N. Monette, Y. Deville, and P. Van Hentenryck. In the Proceedings of the 19th International Conference on  Automated Planning and Scheduling (ICAPS’09), Thessaloniki, Greece, September 2009.
   

10. Evaluation of the Length-Lex Domain. Justin Yip and P. Van Hentenryck. In the Proceedings of the 15th International Conference on Constraint Programming (CP’09), Lisbon, September 2009.
    

11. Constraint-Based Local Search for the Automatic Generation of Architectural Tests. P. Van Hentenryck, Carleton Coffrin, and Boris Gutkovich. In the Proceedings of the 15th International Conference on Constraint Programming (CP’09), Lisbon, September 2009.
    

12. Length-Lex Bound Consistency for Knapsack Constraints. Justin Yip and Pascal Van Hentenryck.  In ACM SAC 2009, Hawaii, March 2009.
    

13. AEON: Synthesizing Scheduling Algorithms from High-Level Models. Jean-Noel Monette, Yves Deville, and Pascal Van Hentenryck. In Proceedings of the 11th Informs Computing Society Conference. Charleston, SC, January 2009.
    

14. Bound Consistency for Binary Length-Lex Set Constraints. Pascal Van Hentenryck, Justin Yip, Carmen Gervet, and Grégoire Dooms. In Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08), Chicago, July 2008.
    

15. Edge Finding for Cumulative Scheduling. Luc Mercier and Pascal Van Hentenryck. In Informs Journal on Computing. 1 (Winter), 2008.
    

16. The Steel Mill Slab Design Problem Revisited.  P. Van Hentenryck, and L. Michel. In CP'AI'OR-08, Paris, France. May 2008. © Springer Verlag.
    

17. Optimal Deployment of Eventually-Serializable Data Services. L. Michel, A. Shvartsman, E. Sonderegger, and Van Hentenryck. In CP'AI'OR-08, Paris, France. May 2008. © Springer Verlag.
    

18. Strong Polynomiality of Resource Constraint Propagation. Luc Mercier and Pascal Van Hentenryck. To Appear in Discrete Optimization.
    

19. Edge Finding for Cumulative Scheduling. Luc Mercier and Pascal Van Hentenryck. To Appear in Informs Journal on Computing.
    

20. Randomized Adaptive Spatial Decoupling For Large-Scale Vehicle Routing with Time Windows. R. Bent and P. Van Hentenryck. To Appear in the Proceedings of the Twenty-Second Conference on Artificial Intelligence, Vancouver, Canada. (AAAI’07).
    

21. Propagating Knapsack Constraints in Sublinear Time. I. Katriel, M. Sellmann, E. Upfal, and P. Van Hentenryck. To Appear in the Proceedings of the Twenty-Second Conference on Artificial Intelligence, Vancouver, Canada. (AAAI’07).
    

22.   High-Level Nondeterministic Abstractions in C++. L. Michel, A. See, and P. Van Hentenryck. CP-06. © Springer Verlag
    

23.   Length-Lex Ordering for Set CSPs. C. Gervet and P. Van Hentenryck. AAAI-06.
    

24.   Nondeterministic Control for Hybrid Search. Pascal Van Hentenryck and Laurent Michel. To Appear in Constraints.
    

25.   Structural Symmetry Breaking. M. Sellmann and P. Van Hentenryck
    

Proceedings of the Joint International Conference on Artificial Intelligence (IJCAI'05), Edinburgh, August 2005.

1.   Compositional Derivation of Symmetries for Constraint Satisfaction. P. Van Hentenryck, Magnus Agren, Pierre Flener, Justin Pearson. Proceedings of the International Symposium on Abstraction, Reformulation, and Approximation (SARA'05), Edinburgh, July 2005. © Springer Verlag.
   

1.   Safe and Tight Linear Estimators for Global Optimization. Glencora Borradaile and Pascal Van Hentenryck. Mathematical Programming, 102(3): 495-517, January 2005, © Springer Verlag.
   

2.   A Decomposition-Based Implementation of Search Strategies. L. Michel and P. Van Hentenryck. ACM Transactions on Computational Logic, 5(2), 2004.
   

3.   Iterative Relaxations for Iterative Flattening in Cumulative Scheduling, Laurent Michel and Pascal Van Hentenryck, Proceeding of the 14th International Conference on Automated Planning & Scheduling,
   

Whistler, British Columbia, Canada, June 3-7 2004.

1. Tractable Symmetry Breaking for CSPs with Interchangeable Values. P. Van Hentenryck, Magnus Agren, Pierre Flener, Justin Pearson. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'03), Acapulco, Mexico, August 2003.
   

2. A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations. M. Janssen, P. Van Hentenryck, and Y. Deville. SIAM Journal on Numerical Analysis, 40(5): 1896-1939, 2002.
   

1. Constraint and Integer Programming in OPL P. Van Hentenryck.
   

Informs Journal on Computing, 14(4), 345-372, 2002.

1. A Constraint Satisfaction Approach to the Robust Spanning Tree with Interval Data. I. Aron and P. Van Hentenryck. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada, August, 2002.
   

1. The Modeling Language OPL: A Short Overview. P. Van Hentenryck and L. Michel. In Optimization Software Class Libraries, Kluwer Academic Publishers, 2002.