| 2008 |
|---|
| 5 | EE | Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks.
ESA 2008: 198-209 |
| 2007 |
|---|
| 4 | EE | Andreas Bley:
Routing and Capacity Optimization for IP Networks.
OR 2007: 9-16 |
| 3 | EE | Andreas Bley:
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths.
Networks 50(1): 29-36 (2007) |
| 2005 |
|---|
| 2 | EE | Andreas Bley:
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.
IPCO 2005: 97-110 |
| 2003 |
|---|
| 1 | EE | Andreas Bley:
On the complexity of vertex-disjoint length-restricted path problems.
Computational Complexity 12(3-4): 131-149 (2003) |
