Andreas Bley

Orcid: 0000-0003-4165-2032

According to our database1, Andreas Bley authored at least 46 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Propagation and Branching Strategies for Job Shop Scheduling Minimizing the Weighted Energy Consumption.
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022

Identifying Critical Demand Periods in Capacity Planning for Networks Including Storage.
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022

2020
Socially Compliant Human-Robot Interaction for Autonomous Scanning Tasks in Supermarket Environments.
Proceedings of the 29th IEEE International Conference on Robot and Human Interactive Communication, 2020

2019
The incremental connected facility location problem.
Comput. Oper. Res., 2019

A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems.
Proceedings of the Operations Research Proceedings 2019, 2019

Job Shop Scheduling with Flexible Energy Prices and Time Windows.
Proceedings of the Operations Research Proceedings 2019, 2019

2017
A node-based ILP formulation for the node-weighted dominating Steiner problem.
Networks, 2017

ROREAS: robot coach for walking and orientation training in clinical post-stroke rehabilitation - prototype implementation and evaluation in field trials.
Auton. Robots, 2017

Joint Optimization of Reorder Points in n-Level Distribution Networks Using (R, Q)-Order Policies.
Proceedings of the Operations Research Proceedings 2017, 2017

Mobile robot companion for walking training of stroke patients in clinical post-stroke rehabilitation.
Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

2016
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems.
Discret. Appl. Math., 2016

Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Job Shop Scheduling With Flexible Energy Prices.
Proceedings of the 30th European Conference on Modelling and Simulation, 2016

2015
User-Centered Design and Evaluation of a Mobile Shopping Robot.
Int. J. Soc. Robotics, 2015

2014
Mobile Robotic Rehabilitation Assistant for walking and orientation training of Stroke Patients: A report on work in progress.
Proceedings of the 2014 IEEE International Conference on Systems, Man, and Cybernetics, 2014

2013
Integrated optimization of aggregation and core for varying NGN architectures.
Telecommun. Syst., 2013

Konzeption und Evaluation des Merkmals "Extraversion" bei einem Shoppingroboter.
i-com, 2013

Approximating connected facility location with buy-at-bulk edge costs via random sampling.
Electron. Notes Discret. Math., 2013

WDM Fiber Replacement Scheduling.
Electron. Notes Discret. Math., 2013

IP modeling of the survivable hop constrained connected facility location problem.
Electron. Notes Discret. Math., 2013

Lagrangian decompositions for the two-level FTTx network design problem.
EURO J. Comput. Optim., 2013

Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem.
Proceedings of the Theory and Applications of Models of Computation, 2013

Realization and user evaluation of a companion robot for people with mild cognitive impairments.
Proceedings of the 2013 IEEE International Conference on Robotics and Automation, 2013

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Clique-based facets for the precedence constrained knapsack problem.
Math. Program., 2012

Further progress towards a home robot companion for people with mild cognitive impairment.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2012

A mobile robot platform for socially assistive home-care applications.
Proceedings of the ROBOTIK 2012, 2012

An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
An Integer Programming Algorithm for Routing Optimization in IP Networks.
Algorithmica, 2011

I'll keep an eye on you: Home robot companion for elderly people with cognitive impairment.
Proceedings of the IEEE International Conference on Systems, 2011

Progress in developing a socially assistive mobile home robot companion for the elderly with mild cognitive impairment.
Proceedings of the 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011

MIP Modeling of Incremental Connected Facility Location.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A strengthened formulation and cutting planes for the open pit mine production scheduling problem.
Comput. Oper. Res., 2010

Securely Connected Facility Location in Metric Graphs.
Proceedings of the Operations Research Proceedings 2010, 2010

Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Optimization of OSPF Routing in IP Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Approximability of unsplittable shortest path routing problems.
Networks, 2009

TOOMAS: Interactive Shopping Guide robots in everyday use - final implementation and experiences from long-term field trials.
Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009

Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling.
Proceedings of the Modeling, 2009

2008
ShopBot: Progress in developing an interactive mobile shopping assistant for everyday use.
Proceedings of the IEEE International Conference on Systems, 2008

2007
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths.
Networks, 2007

Routing and Capacity Optimization for IP Networks.
Proceedings of the Operations Research, 2007

2006
Integer Programming Approaches to Access and Backbone IP Network Planning.
Proceedings of the Modeling, 2006

2005
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

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

1998
Design of broadband virtual private networks: Model and heuristics for the B-WiN.
Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998


  Loading...