The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Bley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Bley
    On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:97-110 [Conf]
  2. Andreas Bley
    On the complexity of vertex-disjoint length-restricted path problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:3-4, pp:131-149 [Journal]

  3. An Integer Programming Algorithm for Routing Optimization in IP Networks. [Citation Graph (, )][DBLP]


  4. Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. [Citation Graph (, )][DBLP]


  5. Routing and Capacity Optimization for IP Networks. [Citation Graph (, )][DBLP]


  6. A strengthened formulation and cutting planes for the open pit mine production scheduling problem. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002