default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Bley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c29]Andreas Bley
, Philipp Hahn:
Identifying Critical Demand Periods in Capacity Planning for Networks Including Storage. OR 2022: 221-227- [c28]Andreas Bley, Andreas Linß:
Propagation and Branching Strategies for Job Shop Scheduling Minimizing the Weighted Energy Consumption. OR 2022: 573-580 - 2020
- [c27]Benjamin Lewandowski, Tim Wengefeld, Sabine Müller, Mathias Jenny, Sebastian Glende, Christof Schröter, Andreas Bley, Horst-Michael Gross:
Socially Compliant Human-Robot Interaction for Autonomous Scanning Tasks in Supermarket Environments. RO-MAN 2020: 363-370
2010 – 2019
- 2019
- [j17]Ashwin Arulselvan, Andreas Bley, Ivana Ljubic:
The incremental connected facility location problem. Comput. Oper. Res. 112 (2019) - [c26]Andreas Bley, Andreas Linß:
Job Shop Scheduling with Flexible Energy Prices and Time Windows. OR 2019: 207-213 - [c25]Andreas Bley, Angela Pape, Frank Fischer:
A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems. OR 2019: 249-255 - 2017
- [j16]Horst-Michael Gross, Andrea Scheidig, Klaus Debes, Erik Einhorn, Markus Eisenbach, Steffen Müller, Thomas Schmiedel, Thanh Q. Trinh, Christoph Weinrich, Tim Wengefeld, Andreas Bley, Christian Martin:
ROREAS: robot coach for walking and orientation training in clinical post-stroke rehabilitation - prototype implementation and evaluation in field trials. Auton. Robots 41(3): 679-698 (2017) - [j15]Andreas Bley, Ivana Ljubic, Olaf Maurer:
A node-based ILP formulation for the node-weighted dominating Steiner problem. Networks 69(1): 33-51 (2017) - [c24]Horst-Michael Gross, Sibylle Meyer, Andrea Scheidig, Markus Eisenbach, Steffen Müller, Thanh Quang Trinh, Tim Wengefeld, Andreas Bley, Christian Martin, Christa Fricke:
Mobile robot companion for walking training of stroke patients in clinical post-stroke rehabilitation. ICRA 2017: 1028-1035 - [c23]Christopher Grob, Andreas Bley, Konrad Schade:
Joint Optimization of Reorder Points in n-Level Distribution Networks Using (R, Q)-Order Policies. OR 2017: 657-662 - 2016
- [j14]Andreas Bley, Mohsen Rezapour:
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. Discret. Appl. Math. 213: 34-46 (2016) - [c22]Maximilian Selmair, Thorsten Claus, Marco Trost, Andreas Bley, Frank Herrmann:
Job Shop Scheduling With Flexible Energy Prices. ECMS 2016: 488-494 - [c21]Felix J. L. Willamowski, Andreas Bley:
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. WAOA 2016: 197-209 - 2015
- [j13]Nicola Doering, Sandra Poeschl, Horst-Michael Gross, Andreas Bley, Christian Martin, Hans-Joachim Boehme:
User-Centered Design and Evaluation of a Mobile Shopping Robot. Int. J. Soc. Robotics 7(2): 203-225 (2015) - 2014
- [c20]Horst-Michael Gross, Klaus Debes, Erik Einhorn, Steffen Müller, Andrea Scheidig, Christoph Weinrich, Andreas Bley, Christian Martin:
Mobile Robotic Rehabilitation Assistant for walking and orientation training of Stroke Patients: A report on work in progress. SMC 2014: 1880-1887 - 2013
- [j12]Andreas Bley, Ivana Ljubic, Olaf Maurer:
Lagrangian decompositions for the two-level FTTx network design problem. EURO J. Comput. Optim. 1(3-4): 221-252 (2013) - [j11]Andreas Bley, Daniel Karch, Fabio D'Andreagiovanni:
WDM Fiber Replacement Scheduling. Electron. Notes Discret. Math. 41: 189-196 (2013) - [j10]Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
IP modeling of the survivable hop constrained connected facility location problem. Electron. Notes Discret. Math. 41: 463-470 (2013) - [j9]Andreas Bley, Mohsen Rezapour:
Approximating connected facility location with buy-at-bulk edge costs via random sampling. Electron. Notes Discret. Math. 44: 313-319 (2013) - [j8]Yvonne Ludewig, Nicola Döring, Andreas Bley:
Konzeption und Evaluation des Merkmals "Extraversion" bei einem Shoppingroboter. i-com 12(1): 23-31 (2013) - [j7]Ulrich Menne, Roland Wessäly, Maren Martens, Andreas Bley:
Integrated optimization of aggregation and core for varying NGN architectures. Telecommun. Syst. 52(2): 1067-1079 (2013) - [c19]Jannik Matuschke, Andreas Bley, Benjamin Müller:
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. ESA 2013: 707-718 - [c18]Ch. Schroeter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Claire A. G. J. Huijnen, Herjan van den Heuvel, Andreas van Berlo, Andreas Bley, Horst-Michael Gross:
Realization and user evaluation of a companion robot for people with mild cognitive impairments. ICRA 2013: 1153-1159 - [c17]Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. TAMC 2013: 72-83 - 2012
- [j6]Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov:
Clique-based facets for the precedence constrained knapsack problem. Math. Program. 133(1-2): 481-511 (2012) - [c16]Andreas Bley:
An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems. CTW 2012: 24-25 - [c15]Matthias Merten, Andreas Bley, Christof Schröter, Horst-Michael Gross:
A mobile robot platform for socially assistive home-care applications. ROBOTIK 2012 - [c14]Horst-Michael Gross, Ch. Schroeter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Andreas Bley, Tim Langner, Matthias Merten, Claire A. G. J. Huijnen, Herjan van den Heuvel, Andreas van Berlo:
Further progress towards a home robot companion for people with mild cognitive impairment. SMC 2012: 637-644 - 2011
- [j5]Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica 60(1): 21-45 (2011) - [c13]Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer:
MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502 - [c12]Horst-Michael Gross, Christof Schröter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Andreas Bley, Christian Martin, Tim Langner, Matthias Merten:
Progress in developing a socially assistive mobile home robot companion for the elderly with mild cognitive impairment. IROS 2011: 2430-2437 - [c11]Horst-Michael Gross, Christof Schröter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Andreas Bley, Tim Langner, Christian Martin, Matthias Merten:
I'll keep an eye on you: Home robot companion for elderly people with cognitive impairment. SMC 2011: 2481-2488 - 2010
- [j4]Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland:
A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. 37(9): 1641-1647 (2010) - [c10]Andreas Bley, José Neto:
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. IPCO 2010: 205-218 - [c9]Maren Martens, Andreas Bley:
Securely Connected Facility Location in Metric Graphs. OR 2010: 289-294 - [p1]Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit:
Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks 2010: 199-240
2000 – 2009
- 2009
- [j3]Andreas Bley:
Approximability of unsplittable shortest path routing problems. Networks 54(1): 23-46 (2009) - [c8]Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske:
Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. HPSC 2009: 25-39 - [c7]Horst-Michael Gross, Hans-Joachim Boehme, Christof Schröter, Steffen Müller, Alexander Koenig, Erik Einhorn, Christian Martin, Matthias Merten, Andreas Bley:
TOOMAS: Interactive Shopping Guide robots in everyday use - final implementation and experiences from long-term field trials. IROS 2009: 2005-2012 - 2008
- [c6]Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks. ESA 2008: 198-209 - [c5]Horst-Michael Gross, Hans-Joachim Böhme, Christof Schröter, Steffen Müller, Alexander König, Christian Martin, Matthias Merten, Andreas Bley:
ShopBot: Progress in developing an interactive mobile shopping assistant for everyday use. SMC 2008: 3471-3478 - 2007
- [j2]Andreas Bley:
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1): 29-36 (2007) - [c4]Andreas Bley:
Routing and Capacity Optimization for IP Networks. OR 2007: 9-16 - 2006
- [c3]Andreas Bley, Thorsten Koch:
Integer Programming Approaches to Access and Backbone IP Network Planning. HPSC 2006: 87-110 - 2005
- [c2]Andreas Bley:
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. IPCO 2005: 97-110 - 2003
- [j1]Andreas Bley:
On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12(3-4): 131-149 (2003)
1990 – 1999
- 1998
- [c1]Andreas Bley, Martin Grötschel, Roland Wessäly:
Design of broadband virtual private networks: Model and heuristics for the B-WiN. Robust Communication Networks: Interconnection and Survivability 1998: 1-16
Coauthor Index
aka: Horst-Michael Gross
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
