Homepage Willem-Jan van Hoeve
Carnegie Bosch Associate Professor of Operations Research
Tepper School of Business
Carnegie Mellon University
Research and Teaching Interests
Operations research; optimization; constraint programming; hybrid solution methods; decision diagrams for optimization; real-world applications of vehicle routing and scheduling
Decision Diagrams for Optimization: The results of this ongoing research project are collected in a separate page, containing publications, source code, and benchmark instances.
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
- Carnegie Bosch Institute Faculty Research Chair (2016-)
- Google Research Award (2015)
- NSF Research Award (2011-2014)
- Google Research Award (2011)
- 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, International Conference on Principles and Practice of Constraint Programming (2006)
- Best student paper award, International Conference on Principles and Practice of Constraint Programming (2004)
Editorial roles
- Guest Editor of Constraints, special issue on the Journal Fast Track for the conference CP (2016).
- Guest Editor of EURO Journal on Computational Optimization, special issue on Constraint Programming Approaches to Combinatorial Optimization (2014)
- Associate Editor of Decision Analytics (2012-)
- Editor of Constraints (2010-2016)
- Editor of Constraint Programming Letters (2006-2008)
Professional Memberships
- Association for Constraint Programming (ACP) - Elected member of the Executive Commitee (2013-2016)
- Steering Committee of CPAIOR conference series
- Institute for Operations Research and the Management Sciences (INFORMS)
- Mathematical Optimization Society (MOS)
Teaching
2016/2017
- 47-862: Constraint Programming (PhD, Mini 1)
- 45-751: Optimization (MBA sections A, B, C, Mini 2)
- 45-751: Optimization (MBA section M, Mini 3)
- 45-950: Operations Research Implementations (MBA, Mini 3)
Meetings
Upcoming conferences and workshops I am involved in or plan to visit:
- CPAIOR 2017, the International Conference on Integration of AI and OR techniques in Constraint Programming, June 5-8, 2017, Padova, Italy. (PC member)
- ICAPS 2017, the International Conference on Automated Planning and Scheduling, June 18-23, 2017, Pittsburgh, PA.
Tutorials and Invited Talks
- Decision Diagrams for Sequencing and Scheduling. ICAPS 2016, the International Conference on Automated Planning and Scheduling, 2016.
- Lagrangian Relaxation in Constraint Programming. CPAIOR Master Class on Decomposition in Optimization, May 29, 2016.
- Decision Diagram-Based Constraint Programming. ACP Summer School on Constraint Programming, 2015.
- Decision Diagrams for Optimization and Scheduling. MAPSP 2015, the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems, 2015.
- Global Constraints and Hybrid Methods. ACP Summer School on Constraint Programming, 2014.
- Decision Diagrams for Discrete Optimization. Optimization Days Montreal, 2014.
- Operations Research: Opportunities and Challenges. INFORMS IE seminar, University of Pittsburgh, 2014.
- Decision Diagrams for Discrete Optimization. Tutorial Forum, Twenty-Seventh AAAI Conference, 2013. slides solutions
- Constraint Programming with Decision Diagrams. International Conference on Principles and Practice of Constraint Programming (CP), 2012. slides
- Introduction to Constraint Programming and Operations Research Techniques in Constraint Programming. ACP Summer School on Constraint Programming, 2012. Material can be found here.
- Global Constraints in Constraint Programming. Optimization Days Montreal, 2010. slides
- Soft Global Constraints. International Conference on Principles and Practice of Constraint Programming (CP), 2009. slides
- Soft Global Constraints. ACP Summer School on Constraint Programming, 2006. slides
Publications
The documents on this page are preprints. The copyright for the published documents rests with the author(s) and the journals or conferences where they were published.
Books
D. Bergman, A. A. Cire, W.-J. van Hoeve, and J. N. Hooker.
Decision Diagrams for Optimization. Springer, 2016.
W.-J. van Hoeve and J. N. Hooker (eds.). Proceedings of the 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.
In Process
J. Kinable and W.-J. van Hoeve. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the TSP with Time Windows. Under Review.
J. Kinable, A. A. Cire, and W.-J. van Hoeve. Hybrid Optimization Methods for Time-Dependent Sequencing Problems. Under Review.
C. Tjandraatmadja and W.-J. van Hoeve. Target Cuts from Relaxed Decision Diagrams. Under Review.
J. Schuijbroek, R. Hampshire, and W.-J. van Hoeve.
Inventory Rebalancing and Vehicle Routing
in Bike Sharing Systems. European Journal of Operational Research, to appear.
Tepper School of Business Working Paper 2013-E1,
Carnegie Mellon University, 2013.
2016
K. Giles and W.-J. van Hoeve. Solving a Supply-Delivery Scheduling Problem with Constraint Programming. In Proceedings of CP, LNCS 9892, pp. 602-617. Springer, 2016.
J. Kinable, W.-J. van Hoeve, and S. F. Smith. Optimization Models for a Real-World Snow Plow Routing Problem. In Proceedings of CPAIOR, LNCS 9676, pp. 229-245. Springer, 2016.
D. Bergman, A. A. Cire, W.-J. van Hoeve, and J. N. Hooker. Discrete Optimization with Decision Diagrams. INFORMS Journal on Computing 28(1):47-66, 2016. (Preprint)
2015
D. Bergman, A. A. Cire, and W.-J. van Hoeve. Improved Constraint Propagation via Lagrangian Decomposition. In Proceedings of CP, LNCS 9255, pp. 30-38. Springer, 2015.
D. Bergman, A. A. Cire, and W.-J. van Hoeve. Lagrangian Bounds from Decision Diagrams. Constraints 20(3):346-361, 2015.
B. Kell, A. Sabharwal, and W.-J. van Hoeve. BDD-Guided Clause Generation. In Proceedings of CPAIOR, LNCS 9075, pp. 215-230. Springer, 2015.
V. Goel, M. Slusky, W.-J. van Hoeve, K. Furman, and Y. Shao. Constraint Programming for LNG Ship Scheduling and Inventory Management. European Journal of Operational Research 241(3): 662-673, 2015.
2014
D. Bergman, A. A. Cire, and W.-J. van Hoeve. MDD Propagation for Sequence Constraints. JAIR, Volume 50, pages 697-722, 2014.
D. Bergman, A. A. Cire, W.-J. van Hoeve, and T. Yunes. BDD-Based Heuristics for Binary Optimization. Journal of Heuristics, 20(2): 211-234, 2014.
D. Bergman, A. A. Cire, W.-J. van Hoeve, and J. N. Hooker. Optimization Bounds from Binary Decision Diagrams. INFORMS Journal on Computing 26(2): 253-258, 2014.
D. Bergman, A. A. Cire, A. Sabharwal, H. Samulowitz, V. Saraswat, and W.-J. van Hoeve. Parallel Combinatorial Optimization with Decision Diagrams. In Proceedings of CPAIOR, LNCS 8451, pp. 351-367. Springer, 2014.
2013
A. A. Cire and W.-J. van Hoeve. Multivalued Decision Diagrams for Sequencing Problems. Operations Research 61(6): 1411-1428, 2013.
W.-J. van Hoeve. Developing Constraint Programming Applications with AIMMS. In Workshop on Domain Specific Languages in Combinatorial Optimization (COSpel), 2013.
B. Kell and W.-J. van Hoeve. An MDD Approach to Multidimensional Bin Packing. In Proceedings of CPAIOR, LNCS 7874, pp. 128-143. Springer, 2013.
M. R. Slusky and W.-J. van Hoeve. A Lagrangian Relaxation for Golomb Rulers. In Proceedings of CPAIOR, LNCS 7874, pp. 251-267. Springer, 2013.
2012
P. Benchimol, W.-J. van Hoeve, J.-C. Régin, L.-M. Rousseau, and M. Rueher. Improved Filtering for Weighted Circuit Constraints. Constraints 17(3): 205-233, 2012. The code is available here.
A. A. Cire and W.-J. van Hoeve. MDD Propagation for Disjunctive Scheduling. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 11-19. AAAI Press, 2012.
A. A. Cire, E. Coban, and W.-J. van Hoeve. Flow-Based Combinatorial Chance Constraints.
In Proceedings of the International Conference on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
(CPAIOR). LNCS 7298, pp. 129-145. Springer, 2012.
Note: The filtering rule for the `most likely matching' is incorrect
as stated in the paper (Lemma 6 in Section 5.3). The experiments did not
expose this error. A correction will be made in an extended version of the paper.
D. Bergman, A.A. 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 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR). LNCS 7298, pp. 34-49. Springer, 2012.
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.
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
D. Bergman, W.-J. van Hoeve, and J. N. Hooker. Manipulating MDD Relaxations for Combinatorial Optimization. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6697, pp. 20-35. Springer, 2011.
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.
R. Steiger, W.-J. van Hoeve, and R. Szymanek. An Efficient Generic Network Flow Constraint. In Proceedings of the ACM Symposium on Applied Computing (SAC), pp. 893-900. ACM, 2011.
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
S. Hoda, W.-J. van Hoeve, and J. N. Hooker. A Systematic Approach to MDD-Based Constraint Programming. In Proceedings of the International Conference on Principles and Practices of Constraint Programming (CP). LNCS 6308, pp. 266-280. Springer, 2010.
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 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 40-44. Springer, 2010.
J.-C. Régin, L.-M. Rousseau, M. Rueher, and W.-J. van Hoeve. The Weighted Spanning Tree Constraint Revisited. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 176-180. Springer, 2010.
C. Gunes, W.-J. van Hoeve, and S. Tayur. Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 6140, pp. 287-291. Springer, 2010.
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
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
Y. Malitsky, M. Sellmann, and W.-J. van Hoeve. Length-Lex Bounds Consistency for Knapsack Constraints. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), LNCS 5202, pp. 266-281. Springer, 2008.
C. P. Gomes, W.-J. van Hoeve, and A. Sabharwal. Connections in Networks: A Hybrid Approach. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 5015, pp. 303-307. Springer, 2008.
W.-J. van Hoeve and A. Sabharwal. Filtering Atmost1 on Pairs of Set Variables. In Proceedings of the 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
C. P. Gomes, W.-J. van Hoeve, A. Sabharwal, and B. Selman. Counting CSP Solutions Using Generalized XOR Constraints. In Proceedings of the Conference on Artificial Intelligence (AAAI 2007), 2007.
W.-J. van Hoeve, C. P. Gomes, M. Lombardi, and B. Selman. Optimal Multi-Agent Scheduling with Constraint Programming. In Proceedings of the Conference on Innovative Applications of Artificial Intelligence (IAAI 2007), 2007.
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 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 4510, pp. 16-28. Springer, 2007.
W.-J. van Hoeve and A. Sabharwal. Two Set-Constraints for Modeling and Efficiency. In Proceedings of the International Workshop on Constraint Modelling and Reformulation (ModRef 2007), 2007.
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
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.
W.-J. van Hoeve, G. Pesant, L.-M. Rousseau and A. Sabharwal. Revisiting the Sequence Constraint. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 620-634, LNCS 4204, 2006. Best paper award.
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.
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.
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.
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.
W.J. van Hoeve. Exploiting Semidefinite Relaxations in Constraint Programming. Computers and Operations Research 33(10):2787-2804, 2006.
2005
W.-J. van Hoeve. Operations Research Techniques in Constraint Programming. PhD thesis, University of Amsterdam, 2005.
2004
W.J. van Hoeve. A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint. In International Conference on Principles and Practice of Constraint Programming (CP), LNCS 3258, pp. 679-689. Springer, 2004. Best student paper award.
W.J. van Hoeve, G. Pesant and L.-M. Rousseau. On Global Warming (Softening Global Constraints). In International Workshop on Preferences and Soft Constraints (held in conjunction with CP), 2004.
W.J. van Hoeve and
M. Milano. Postponing Branching Decisions. In
European Conference on Artificial Intelligence
(ECAI 2004),
pp. 1105-1106. IOS Press, 2004.
An extended version
is also available.
2003
W.J. van Hoeve. A hybrid constraint programming and semidefinite programming approach for the stable set problem. In International Conference on Principles and Practice of Constraint Programming (CP), LNCS 2833, pp. 407-421. Springer, 2003.
W.J. van Hoeve. A hybrid constraint programming and semidefinite programming
approach for the stable set problem. In International Workshop on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems (CPAIOR), pp. 3-16, 2003.
W.J. van Hoeve and M. Milano. Decomposition Based Search. A theoretical and experimental evaluation. LIA Technical Report LIA00203, University of Bologna, 2003.
2002
M. Milano and W.J. van Hoeve. Reduced cost-based ranking for generating promising subproblems. In International Conference on Principles and Practice of Constraint Programming (CP), LNCS 2470, pp. 1-16. Springer, 2002.
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
W.J. van Hoeve. The Alldifferent Constraint: A Survey.
Annual Workshop of the ERCIM Working Group on Constraints, Prague, June 2001.
An extended version is also available.