Willem-Jan Van Hoeve

Professor of Operations Research

Carnegie Mellon University
Country flagUnited States

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Willem-Jan Van Hoeve is a Professor of Operations Research at Carnegie Mellon University, USA. His research focuses on decision diagrams, route optimization, and constraint programming, as evidenced by his recent articles on topics such as truck-drone routing and variable ordering for decision diagrams. He is actively contributing to advancements in graph coloring and snow plow route optimization methodologies.

Articles (6)

Year:

2026

Binary bilevel programs are notoriously difficult to solve due to the absence of strong and efficiently computable relaxations. In this work, we introduce a novel single-level reformulation of these programs by leveraging a network flow-based representation of the follower’s value function, utilizing decision diagrams and linear programming duality. This approach enables the development of scalable relaxations by applying it to a restricted solution set, which in turn provides dual bounds. We obtain an exact method by iteratively solving and strengthening the relaxation. We further extend the reformulation to address the pessimistic version of the original bilevel problem. We experimentally compare our method with state-of-the-art bilevel programming solvers, demonstrating competitive performance. Specifically, on the BOBILib benchmark set our approach provides new or improved bounds for six instances and closes two open instances for the first time. We also show experimentally that the decision diagram reformulation can be particularly effective when it can leverage the combinatorial structure of the follower’s problem.

Year:

2025

For vehicle routing problems, strong dual bounds on the optimal value are needed to develop scalable exact algorithms as well as to evaluate the performance of heuristics. In this work, we propose an iterative algorithm to compute dual bounds motivated by connections between decision diagrams and dynamic programming models used for pricing in branch-and-cut-and-price algorithms. We apply techniques from the decision diagram literature to generate and strengthen novel route relaxations for obtaining dual bounds without using column generation. Our approach is generic and can be applied to various vehicle routing problems in which corresponding dynamic programming models are available. We apply our framework to the traveling salesman with drone problem and show that it produces dual bounds competitive to those from the state of the art. Applied to larger problem instances in which the state-of-the-art approach does not scale, our method outperforms other bounding techniques from the literature. Funding: This work was supported by the National Science Foundation [Grant 1918102] and the Office of Naval Research [Grants N00014-18-1-2129 and N00014-21-1-2240]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2021.0170 .

Year:

2024

Year:

2022

Year:

2022

Year:

2021

Collaborators (2)

Leonardo Lozano

Associate Professor

University of Cincinnati

UNITED STATES
View details

Laurent Michel

Professor & Synchrony Chair in Cybersecurity

University of Connecticut

UNITED STATES
View details