Homepage Willem-Jan van Hoeve



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

Faculty Coordinator of the MBA Track on Business Analytics.

Research Interests

constraint programming; combinatorial optimization; 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

Honors and Awards

  • Google Research Award (2012)
  • NSF Research Award (2011-2014)
  • George Leland Bach MBA Teaching Award (2011)
  • Faculty Giving Chair (2011-2012)
  • Berkman Faculty Development Grant (2010)
  • BP Junior Faculty Chair (2008-2009)
  • Best paper award, Twelfth International Conference on Principles and Practice of Constraint Programming (2006)
  • Best student paper award, Tenth International Conference on Principles and Practice of Constraint Programming (2004)

Teaching

2011/2012

Spring: 45-865 Business Analytics Capstone Project
Mini-3: 45-864 Operations Research Implementations (with Michael Trick)
Mini-4: 45-860 Applications of Operations Research (Sections A, E, and M)

Announcements

Upcoming conferences and workshops I am involved in or plan to visit:

  • INFORMS Optimization Society Conference 2012, February 24-26, Miami, FL.
  • CPAIOR 2012, The 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, May 28 - June 1, 2012, Nantes, France.
  • ICAPS 2012, the 22nd International Conference on Automated Planning and Scheduling, June 25-29, 2012, Sao Paulo, Brazil.
  • MOPTA 2012, Modeling OPtimization Conference: Theory and Applications, July 30 - August 1, 2012, Bethlehem, PA.
  • ISMP 2012, The 21st International Symposium on Mathematical Programming, August 19-24, 2012, Berlin, Germany.
  • CP 2012, The 18th International Conference on Principles and Practice of Constraint Programming, October 8-12, 2012, Quebec City, Canada.
  • INFORMS Annual Meeting 2012, October 14-17, 2012, Phoenix, AZ.

Other:

Tutorials

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.

Working Papers and Forthcoming Papers

[45] W.-J. van Hoeve. MDD Propagation for Sequence Constraints. Tepper School of Business Working Paper 2011-E12, Carnegie Mellon University, 2011.

2012

[44] A.E. Cire and W.-J. van Hoeve. MDD Propagation for Disjunctive Scheduling. In Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling (ICAPS). AAAI Press, 2012.

[43] A.E. Cire, E. Coban, and W.-J. van Hoeve. Flow-Based Combinatorial Chance Constraints. In Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR). Springer, 2012.

[42] D. Bergman, A.E. Cire, W.-J. van Hoeve, and J.N. Hooker. Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. In Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR). Springer, 2012.

[41] W.-J. van Hoeve. Semidefinite Programming and Constraint Programming. Chapter 22 of M.F. Anjos and J.B. Lasserre (eds.), Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, Springer, 2012.

[40] J. Conrad, C.P. Gomes, W.-J. van Hoeve, A. Sabharwal, and J.F. Suter. Wildlife corridors as a connected subgraph problem. Journal of Environmental Economics and Management 63(1): 1-18, 2012.

2011

[39] D. Bergman, W.-J. van Hoeve, and J. N. Hooker. Manipulating MDD Relaxations for Combinatorial Optimization. In Proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6697, pp. 20-35. Springer, 2011.

[38] W.-J. van Hoeve, M. Hunting, and C. Kuip. The Aimms Interface to Constraint Programming. In Proceedings of Late Breaking Abstracts of CPAIOR, pp. 41-43, 2011.

[37] R. Steiger, W.-J. van Hoeve, and R. Szymanek. An Efficient Generic Network Flow Constraint. In Proceedings of the 26th ACM Symposium on Applied Computing (SAC), pp. 893-900. ACM, 2011.

[36] W.-J. van Hoeve. Over-Constrained Problems. Chapter in P. Van Hentenryck and M. Milano (eds.), Hybrid Optimization: The Ten Years of CPAIOR, pp. 191-225. Springer, 2011.

2010

[35] S. Hoda, W.-J. van Hoeve, and J.N. Hooker. A Systematic Approach to MDD-Based Constraint Programming. In Proceedings of the 16th International Conference on Principles and Practices of Constraint Programming (CP). LNCS 6308, pp. 266-280. Springer, 2010.

[34] P. Benchimol, J.-C. Régin, L.-M. Rousseau, M. Rueher, and W.-J. van Hoeve. Improving the Held and Karp Approach with Constraint Programming. In Proceedings of the Seventh International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 40-44. Springer, 2010.

[33] J.-C. Régin, L.-M. Rousseau, M. Rueher, and W.-J. van Hoeve. The Weighted Spanning Tree Constraint Revisited. In Proceedings of the Seventh International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 176-180. Springer, 2010.

[32] C. Gunes, W.-J. van Hoeve, and S. Tayur. Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches. In Proceedings of the Seventh International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 287-291. Springer, 2010.

[31] B.K. Peterson, W.-J. van Hoeve, L.G. Debo, and S. Kekre. Flexible Milk-Runs for Stochastic Vehicle Routing. Tepper School of Business Working Paper 2010-E78, Carnegie Mellon University, 2010.

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), 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), 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), 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 (CPAIOR), 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), 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 (CPAIOR), 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 (CPAIOR), 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), 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.

[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), 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 (CPAIOR), 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), 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