10 citations · 38 across the 10 of their papers we have counts for
3 papers · 1 filter
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
Markus Ahrens, Dorothee Henke, Stefan Rabenstein +1
We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra's algorithm to find shortest paths in huge incomplete grid…
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Jannik Irmai
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. T…
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
We investigate the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective, in a robust optimization approach. We show that the robust counter…