Design of broadband virtual private networks: Model and heuristics for the B-WiN. - Andreas Bley; Martin Grötschel; Roland Wessäly (Robust Communication Networks: Interconnection and Survivability, 1998)

On the complexity of vertex-disjoint length-restricted path problems. - Andreas Bley (Comput. Complex., 2003)

On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. - Andreas Bley (IPCO, 2005)

Integer Programming Approaches to Access and Backbone IP Network Planning. - Andreas Bley; Thorsten Koch (HPSC, 2006)

Routing and Capacity Optimization for IP Networks. - Andreas Bley (OR, 2007)

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. - Andreas Bley (Networks, 2007)

ShopBot: Progress in developing an interactive mobile shopping assistant for everyday use. - Horst-Michael Gross; Hans-Joachim Böhme; Christof Schröter; Steffen Müller 001; Alexander König; Christian Martin 001; Matthias Merten; Andreas Bley (SMC, 2008)

Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. - Andreas Bley; Ambros M. Gleixner; Thorsten Koch; Stefan Vigerske (HPSC, 2009)

TOOMAS: Interactive Shopping Guide robots in everyday use - final implementation and experiences from long-term field trials. - Horst-Michael Gross; Hans-Joachim Boehme; Christof Schröter; Steffen Müller 001; Alexander Koenig; Erik Einhorn; Christian Martin 001; Matthias Merten; Andreas Bley (IROS, 2009)

Approximability of unsplittable shortest path routing problems. - Andreas Bley (Networks, 2009)

Optimization of OSPF Routing in IP Networks. - Andreas Bley; Bernard Fortz; Éric Gourdin; Kaj Holmberg; Olivier Klopfenstein; Michal Pióro; Artur Tomaszewski; Hakan Ümit (Graphs and Algorithms in Communication Networks, 2010)

Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. - Andreas Bley; José Neto 001 (IPCO, 2010)

Securely Connected Facility Location in Metric Graphs. - Maren Martens; Andreas Bley (OR, 2010)

A strengthened formulation and cutting planes for the open pit mine production scheduling problem. - Andreas Bley; Natashia Boland; Christopher Fricke; Gary Froyland (Comput. Oper. Res., 2010)

MIP Modeling of Incremental Connected Facility Location. - Ashwin Arulselvan; Andreas Bley; Stefan Gollowitzer; Ivana Ljubic; Olaf Maurer (INOC, 2011)

Progress in developing a socially assistive mobile home robot companion for the elderly with mild cognitive impairment. - Horst-Michael Gross; Christof Schröter; Steffen Müller 001; Michael Volkhardt; Erik Einhorn; Andreas Bley; Christian Martin 001; Tim Langner; Matthias Merten (IROS, 2011)

I'll keep an eye on you: Home robot companion for elderly people with cognitive impairment. - Horst-Michael Gross; Christof Schröter; Steffen Müller 001; Michael Volkhardt; Erik Einhorn; Andreas Bley; Tim Langner; Christian Martin 001; Matthias Merten (SMC, 2011)

An Integer Programming Algorithm for Routing Optimization in IP Networks. - Andreas Bley (Algorithmica, 2011)

An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems. - Andreas Bley (CTW, 2012)

A mobile robot platform for socially assistive home-care applications. - Matthias Merten; Andreas Bley; Christof Schröter; Horst-Michael Gross (ROBOTIK, 2012)

Further progress towards a home robot companion for people with mild cognitive impairment. - Horst-Michael Gross; Ch. Schroeter; Steffen Müller 001; Michael Volkhardt; Erik Einhorn; Andreas Bley; Tim Langner; Matthias Merten; Claire A. G. J. Huijnen; Herjan van den Heuvel; Andreas van Berlo (SMC, 2012)

Clique-based facets for the precedence constrained knapsack problem. - Natashia Boland; Andreas Bley; Christopher Fricke; Gary Froyland; Renata Sotirov (Math. Program., 2012)

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. - Jannik Matuschke; Andreas Bley; Benjamin Müller 002 (ESA, 2013)

Realization and user evaluation of a companion robot for people with mild cognitive impairments. - Ch. Schroeter; Steffen Müller 001; Michael Volkhardt; Erik Einhorn; Claire A. G. J. Huijnen; Herjan van den Heuvel; Andreas van Berlo; Andreas Bley; Horst-Michael Gross (ICRA, 2013)

Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. - Andreas Bley; S. Mehdi Hashemi; Mohsen Rezapour (TAMC, 2013)

Lagrangian decompositions for the two-level FTTx network design problem. - Andreas Bley; Ivana Ljubic; Olaf Maurer (EURO J. Comput. Optim., 2013)

IP modeling of the survivable hop constrained connected facility location problem. - Andreas Bley; S. Mehdi Hashemi; Mohsen Rezapour (Electron. Notes Discret. Math., 2013)

WDM Fiber Replacement Scheduling. - Andreas Bley; Daniel Karch; Fabio D'Andreagiovanni (Electron. Notes Discret. Math., 2013)

Approximating connected facility location with buy-at-bulk edge costs via random sampling. - Andreas Bley; Mohsen Rezapour (Electron. Notes Discret. Math., 2013)

Konzeption und Evaluation des Merkmals "Extraversion" bei einem Shoppingroboter. - Yvonne Ludewig; Nicola Döring; Andreas Bley (i-com, 2013)

Integrated optimization of aggregation and core for varying NGN architectures. - Ulrich Menne; Roland Wessäly; Maren Martens; Andreas Bley (Telecommun. Syst., 2013)

Mobile Robotic Rehabilitation Assistant for walking and orientation training of Stroke Patients: A report on work in progress. - Horst-Michael Gross; Klaus Debes; Erik Einhorn; Steffen Müller 001; Andrea Scheidig; Christoph Weinrich; Andreas Bley; Christian Martin 001 (SMC, 2014)

User-Centered Design and Evaluation of a Mobile Shopping Robot. - Nicola Doering; Sandra Poeschl; Horst-Michael Gross; Andreas Bley; Christian Martin 001; Hans-Joachim Boehme (Int. J. Soc. Robotics, 2015)

Job Shop Scheduling With Flexible Energy Prices. - Maximilian Selmair; Thorsten Claus; Marco Trost; Andreas Bley; Frank Herrmann (ECMS, 2016)

Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. - Felix J. L. Willamowski; Andreas Bley (WAOA, 2016)

Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. - Andreas Bley; Mohsen Rezapour (Discret. Appl. Math., 2016)

Mobile robot companion for walking training of stroke patients in clinical post-stroke rehabilitation. - Horst-Michael Gross; Sibylle Meyer; Andrea Scheidig; Markus Eisenbach 001; Steffen Müller 001; Thanh Quang Trinh; Tim Wengefeld; Andreas Bley; Christian Martin 001; Christa Fricke (ICRA, 2017)

Joint Optimization of Reorder Points in n-Level Distribution Networks Using (R, Q)-Order Policies. - Christopher Grob; Andreas Bley; Konrad Schade (OR, 2017)

ROREAS: robot coach for walking and orientation training in clinical post-stroke rehabilitation - prototype implementation and evaluation in field trials. - Horst-Michael Gross; Andrea Scheidig; Klaus Debes; Erik Einhorn; Markus Eisenbach 001; Steffen Müller 001; Thomas Schmiedel; Thanh Q. Trinh; Christoph Weinrich; Tim Wengefeld; Andreas Bley; Christian Martin 001 (Auton. Robots, 2017)

A node-based ILP formulation for the node-weighted dominating Steiner problem. - Andreas Bley; Ivana Ljubic; Olaf Maurer (Networks, 2017)

Job Shop Scheduling with Flexible Energy Prices and Time Windows. - Andreas Bley; Andreas Linß (OR, 2019)

A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems. - Andreas Bley; Angela Pape; Frank Fischer 002 (OR, 2019)

The incremental connected facility location problem. - Ashwin Arulselvan; Andreas Bley; Ivana Ljubic (Comput. Oper. Res., 2019)

Socially Compliant Human-Robot Interaction for Autonomous Scanning Tasks in Supermarket Environments. - Benjamin Lewandowski; Tim Wengefeld; Sabine Müller 005; Mathias Jenny; Sebastian Glende; Christof Schröter; Andreas Bley; Horst-Michael Gross (RO-MAN, 2020)

Identifying Critical Demand Periods in Capacity Planning for Networks Including Storage. - Andreas Bley; Philipp Hahn (OR, 2022)

Propagation and Branching Strategies for Job Shop Scheduling Minimizing the Weighted Energy Consumption. - Andreas Bley; Andreas Linß (OR, 2022)

Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis. - Andreas Bley; Philipp Hahn (Networks, 2024)