Author Info
Name
Affiliation
Papers
ANDREAS BLEY
Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany
5
Collaborators
Citations 
PageRank 
3
49
3.04
Referers 
Referees 
References 
91
155
89
Search Limit
100155
Title
Citations
PageRank
Year
Approximability of unsplittable shortest path routing problems90.552009
Comparing MIQCP solvers to a specialised algorithm for mine production scheduling50.562009
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths110.622007
Integer Programming Approaches to Access and Backbone IP Network Planning.130.682006
On the approximability of the minimum congestion unsplittable shortest path routing problem110.632005