PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bley, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Optimization of OSPF Routing in IP Networks.

, , , , , , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Prof. Dr. Andreas Hotho

Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)
Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)Clustern mit Hintergrundwissen.. Karlsruhe Institute of Technology, (2004)

Junior-Prof. Dr.-Ing. Andreas Pott

Andreas Kaufmann

Andreas Pahler University of Stuttgart

Hon. -Prof. Dr. -Ing. Andreas Pott University of Stuttgart

 

Other publications of authors with the same name

An Integer Programming Algorithm for Routing Optimization in IP Networks.. ESA, volume 5193 of Lecture Notes in Computer Science, page 198-209. Springer, (2008)Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 707-718. Springer, (2013)Design of broadband virtual private networks: Model and heuristics for the B-WiN., , and . Robust Communication Networks: Interconnection and Survivability, volume 53 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 1-16. DIMACS/AMS, (1998)A node-based ILP formulation for the node-weighted dominating Steiner problem., , and . Networks, 69 (1): 33-51 (2017)Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths.. Networks, 50 (1): 29-36 (2007)ShopBot: Progress in developing an interactive mobile shopping assistant for everyday use., , , , , , , and . SMC, page 3471-3478. IEEE, (2008)Securely Connected Facility Location in Metric Graphs., and . OR, page 289-294. Springer, (2010)An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems.. CTW, page 24-25. (2012)A strengthened formulation and cutting planes for the open pit mine production scheduling problem., , , and . Computers & OR, 37 (9): 1641-1647 (2010)The incremental connected facility location problem., , and . Computers & OR, (2019)