Homepage Willem-Jan van Hoeve

Assistant Professor of Operations Research at the Tepper School of Business of Carnegie Mellon University.

Research Interests

combinatorial optimization; constraint programming; mathematical programming; integration of constraint programming and mathematical programming.

Coordinates

Tepper School of Business
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213
USA

office: Posner Hall 239
phone: (+1) 412-268-9655
fax: (+1) 412-268-7345
email: vanhoeve@andrew.cmu.edu

Awards

BP Junior Faculty Chair 2008-2009.
Best paper award, Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006).
Best student paper award, Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004).

Teaching

2009/2010

Mini-1: 45-760 Optimization and Decision Making (Sections A, B, and C)
Mini-3: 45-862 Optimization Models for Operations
Mini-3: 45-864 Operations Research Implementations (with Michael Trick)

2008/2009

Mini-1: 45-760 Optimization and Decision Making (Sections F and M)
Mini-3: 45-862 Optimization Models for Operations

2007/2008

Mini-1: 47-855 Optimization, Logic and Constraint Satisfaction
Mini-3: 45-862 Optimization Models for Logistics
Spring: 70-460 Mathematical Models for Consulting

Announcements

Upcoming conferences:

CPAIOR 2010, The 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, June 14-18, 2010, Bologna, Italy.
AAAI 2010, The 24th AAAI Conference on Artificial Intelligence, July 11-15, 2010, Atlanta, GA.

Other:

The slides of my tutorial on Soft Global Constraints at the conference CP 2009 can be downloaded from here.
I am a member of
- The Constraint Programming Society in North America (CPNA), and a member of its steering committee (2007-2009),
- The Association for Constraint Programming (ACP),
- The Institute for Operations Research and the Management Sciences (INFORMS),
The history of the CPAIOR conference series can be found here.
Submit a paper to Constraint Programming Letters, the new journal on Constraint Programming.
The slides of my lectures on Soft Global Constraints at the Second International Summer School on Constraint Programming (2006) can be downloaded from here.

Publications

All documents on this page are provided for the sole purpose of early and rapid dissemination of research results. The copyright for these documents rests with the author(s) and the journals or conferences where they were published.

Forthcoming

[31] W.-J. van Hoeve. Over-Constrained Problems. Chapter 6 of P. Van Hentenryck and M. Milano (eds.), Hybrid Optimization: the 10 years of CPAIOR, Springer.

2009

[30] W.-J. van Hoeve and J.N. Hooker (eds.). Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), volume 5547 of Lecture Notes in Computer Science, Springer, 2009.

[29] W.-J. van Hoeve, G. Pesant, L.-M. Rousseau, and A. Sabharwal. New Filtering Algorithms for Combinations of Among Constraints. Constraints 14:273-292, 2009.

2008

[28] Y. Malitsky, M. Sellmann, and W.-J. van Hoeve. Length-Lex Bounds Consistency for Knapsack Constraints. In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008), LNCS 5202, pp. 266-281. Springer, 2008.

[27] C.P. Gomes, W.-J. van Hoeve, and A. Sabharwal. Connections in Networks: A Hybrid Approach. In Proceedings of the Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), LNCS 5015, pp. 303-307. Springer, 2008.

[26] W.-J. van Hoeve and A. Sabharwal. Filtering Atmost1 on Pairs of Set Variables. In Proceedings of the Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), LNCS 5015, pp. 382-386. Springer, 2008.

2007

[25] C.P. Gomes, W.-J. van Hoeve, A. Sabharwal, and B. Selman. Counting CSP Solutions Using Generalized XOR Constraints. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI 2007), 2007.

[24] W.-J. van Hoeve, C.P. Gomes, M. Lombardi, and B. Selman. Optimal Multi-Agent Scheduling with Constraint Programming. In Proceedings of the Nineteenth Conference on Innovative Applications of Artificial Intelligence (IAAI 2007), 2007.

[23] J. Conrad, C.P. Gomes, W.-J. van Hoeve, A. Sabharwal, and J. Suter. Connections in Networks: Hardness of Feasibility versus Optimality. In Proceedings of the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2007), LNCS 4510, pp. 16-28. Springer, 2007.

[22] W.-J. van Hoeve and A. Sabharwal. Two Set-Constraints for Modeling and Efficiency. In Proceedings of the 6th International Workshop on Constraint Modelling and Reformulation (ModRef 2007), 2007.

[21] G. Dooms, L. Mercier, P. Van Hentenryck, W.-J. van Hoeve and L. Michel. Length-Lex Open Constraints. Technical Report CS-07-09, Brown University, 2007.

2006

[20] W.-J. van Hoeve and I. Katriel. Global Constraints. Chapter 6 of F. Rossi, P. van Beek and T. Walsh (eds.), Handbook of Constraint Programming, Elsevier 2006.

[19] W.-J. van Hoeve, G. Pesant, L.-M. Rousseau and A. Sabharwal. Revisiting the Sequence Constraint. In Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006), pp. 620-634, LNCS 4204, 2006. Best paper award.

[18] W.-J. van Hoeve, G. Pesant and L.-M. Rousseau. On Global Warming: Flow-Based Soft Global Constraints. Journal of Heuristics 12(4-5):347-373, 2006.

[17] W.-J. van Hoeve and J.-C. Régin. Open Constraints in a Closed World. In Proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2006), LNCS 3990, pp. 244-257. Springer, 2006.

[16] C.P. Gomes, W.-J. van Hoeve and L. Leahu. The Power of Semidefinite Programming Relaxations for MAX-SAT. In Proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2006), LNCS 3990, pp. 104-118. Springer, 2006.

[15] C.P. Gomes, W.-J. van Hoeve and B. Selman. Constraint Programming for Distributed Planning and Scheduling. In AAAI Spring Symposium on Distributed Plan and Schedule Management, 2006.

[14] W.J. van Hoeve. Exploiting Semidefinite Relaxations in Constraint Programming. Computers and Operations Research 33(10):2787-2804, 2006.

2005

[13] W.-J. van Hoeve. Operations Research Techniques in Constraint Programming. PhD thesis, University of Amsterdam, 2005.

2004

[12] W.J. van Hoeve. A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint. In Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004), LNCS 3258, pp. 679-689. © Springer, 2004. Best student paper award.

[11] W.J. van Hoeve, G. Pesant and L.-M. Rousseau. On Global Warming (Softening Global Constraints). In 6th International Workshop on Preferences and Soft Constraints (held in conjunction with CP 2004), 2004.

[10] W.J. van Hoeve and M. Milano. Postponing Branching Decisions. In 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 1105-1106. IOS Press, 2004.
An extended version (unpublished) is also available.

2003

[9] W.J. van Hoeve. A hybrid constraint programming and semidefinite programming approach for the stable set problem. In Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), LNCS 2833, pp. 407-421. © Springer, 2003.

[8] W.J. van Hoeve. A hybrid constraint programming and semidefinite programming approach for the stable set problem. In Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2003), pp. 3-16, 2003.
Also at Optimization Days 2003, Montreal.

[7] W.J. van Hoeve and M. Milano. Decomposition Based Search. A theoretical and experimental evaluation. LIA Technical Report LIA00203, University of Bologna, 2003.

2002

[6] M. Milano and W.J. van Hoeve. Reduced cost-based ranking for generating promising subproblems. In Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), LNCS 2470, pp. 1-16. © Springer, 2002.

[5] M. Milano and W.J. van Hoeve. Reduced cost-based ranking for generating promising subproblems. Joint ERCIM - CologNet Workshop on Constraint Solving and Constraint Logic Programming, pp. 7-22, Cork (Ireland), June 2002.

2001

[4] W.J. van Hoeve. The Alldifferent Constraint: A Survey. Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague, June 2001.
An extended version is also available.

2000

[3] W.J. van Hoeve. Towards the integration of constraint logic programming and mathematical programming. Master's Thesis, University of Twente, Enschede, 2000.

[2] V.D. Cung, F. Roupin and W.J. van Hoeve, A parallel Branch-and-Bound algorithm using a semidefinite programming relaxation for the maximum independent set. ROADEF 2000, January 2000.

1999

[1] W.J. van Hoeve. Parallel Branch-and-bound algorithms using semidefinite programming relaxation for the independent set problem. Technical Report, Laboratoire PRiSM, Versailles, 1999.

official faculty directory

curriculum vitae

picture