research
∙
11/11/2021
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
We develop new algorithmic techniques for VLSI detailed routing. First, ...
share
research
∙
08/27/2021
The stochastic bilevel continuous knapsack problem with uncertain follower's objective
We consider a bilevel continuous knapsack problem where the leader contr...
research
∙
05/18/2021
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
We investigate the complexity of bilevel combinatorial optimization with...
research
∙
12/23/2020
On the Complexity of the Bilevel Minimum Spanning Tree Problem
We consider the bilevel minimum spanning tree (BMST) problem where the l...
research
∙
03/07/2019
