Andreas Bley - RankMe

48 papers A* 2A 4B 8C 4Misc 2Journal 18Unranked 9

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis. Networks Andreas Bley, Philipp Hahn
2022	—	`conf`	Identifying Critical Demand Periods in Capacity Planning for Networks Including Storage. OR Andreas Bley, Philipp Hahn
2022	—	`conf`	Propagation and Branching Strategies for Job Shop Scheduling Minimizing the Weighted Energy Consumption. OR Andreas Bley, Andreas Linß
2020	B	`conf`	Socially Compliant Human-Robot Interaction for Autonomous Scanning Tasks in Supermarket Environments. RO-MAN Benjamin Lewandowski, Tim Wengefeld, Sabine Müller, Mathias Jenny, Sebastian Glende, Christof Schröter, Andreas Bley, Horst-Michael Gross
2019	—	`conf`	A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems. OR Andreas Bley, Angela Pape, Frank Fischer
2019	—	`conf`	Job Shop Scheduling with Flexible Energy Prices and Time Windows. OR Andreas Bley, Andreas Linß
2019	J	`jnl`	The incremental connected facility location problem. Comput. Oper. Res. Ashwin Arulselvan, Andreas Bley, Ivana Ljubic
2017	J	`jnl`	A node-based ILP formulation for the node-weighted dominating Steiner problem. Networks Andreas Bley, Ivana Ljubic, Olaf Maurer
2017	—	`conf`	Joint Optimization of Reorder Points in n-Level Distribution Networks Using (R, Q)-Order Policies. OR Christopher Grob, Andreas Bley, Konrad Schade
2017	A*	`conf`	Mobile robot companion for walking training of stroke patients in clinical post-stroke rehabilitation. ICRA Horst-Michael Gross, Sibylle Meyer, Andrea Scheidig, Markus Eisenbach, Steffen Müller, Thanh Quang Trinh, Tim Wengefeld, Andreas Bley, Christian Martin, Christa Fricke
2017	J	`jnl`	ROREAS: robot coach for walking and orientation training in clinical post-stroke rehabilitation - prototype implementation and evaluation in field trials. Auton. Robots 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
2016	J	`jnl`	Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. Discret. Appl. Math. Andreas Bley, Mohsen Rezapour
2016	C	`conf`	Job Shop Scheduling With Flexible Energy Prices. ECMS Maximilian Selmair, Thorsten Claus, Marco Trost, Andreas Bley, Frank Herrmann
2016	B	`conf`	Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. WAOA Felix J. L. Willamowski, Andreas Bley
2015	J	`jnl`	User-Centered Design and Evaluation of a Mobile Shopping Robot. Int. J. Soc. Robotics Nicola Doering, Sandra Poeschl, Horst-Michael Gross, Andreas Bley, Christian Martin, Hans-Joachim Boehme
2014	B	`conf`	Mobile Robotic Rehabilitation Assistant for walking and orientation training of Stroke Patients: A report on work in progress. SMC Horst-Michael Gross, Klaus Debes, Erik Einhorn, Steffen Müller, Andrea Scheidig, Christoph Weinrich, Andreas Bley, Christian Martin
2013	J	`jnl`	Approximating connected facility location with buy-at-bulk edge costs via random sampling. Electron. Notes Discret. Math. Andreas Bley, Mohsen Rezapour
2013	A	`conf`	Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. ESA Jannik Matuschke, Andreas Bley, Benjamin Müller
2013	C	`conf`	Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. TAMC Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour
2013	J	`jnl`	IP modeling of the survivable hop constrained connected facility location problem. Electron. Notes Discret. Math. Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour
2013	J	`jnl`	Integrated optimization of aggregation and core for varying NGN architectures. Telecommun. Syst. Ulrich Menne, Roland Wessäly, Maren Martens, Andreas Bley
2013	J	`jnl`	Konzeption und Evaluation des Merkmals "Extraversion" bei einem Shoppingroboter. i-com Yvonne Ludewig, Nicola Döring, Andreas Bley
2013	J	`jnl`	Lagrangian decompositions for the two-level FTTx network design problem. EURO J. Comput. Optim. Andreas Bley, Ivana Ljubic, Olaf Maurer
2013	A*	`conf`	Realization and user evaluation of a companion robot for people with mild cognitive impairments. ICRA 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
2013	J	`jnl`	WDM Fiber Replacement Scheduling. Electron. Notes Discret. Math. Andreas Bley, Daniel Karch, Fabio D'Andreagiovanni
2012	—	`conf`	A mobile robot platform for socially assistive home-care applications. ROBOTIK Matthias Merten, Andreas Bley, Christof Schröter, Horst-Michael Gross
2012	C	`conf`	An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems. CTW Andreas Bley
2012	J	`jnl`	Clique-based facets for the precedence constrained knapsack problem. Math. Program. Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov
2012	B	`conf`	Further progress towards a home robot companion for people with mild cognitive impairment. SMC 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
2011	J	`jnl`	An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica Andreas Bley
2011	B	`conf`	I'll keep an eye on you: Home robot companion for elderly people with cognitive impairment. SMC Horst-Michael Gross, Christof Schröter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Andreas Bley, Tim Langner, Christian Martin, Matthias Merten
2011	C	`conf`	MIP Modeling of Incremental Connected Facility Location. INOC Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer
2011	A	`conf`	Progress in developing a socially assistive mobile home robot companion for the elderly with mild cognitive impairment. IROS Horst-Michael Gross, Christof Schröter, Steffen Müller, Michael Volkhardt, Erik Einhorn, Andreas Bley, Christian Martin, Tim Langner, Matthias Merten
2010	J	`jnl`	A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland
2010	B	`conf`	Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. IPCO Andreas Bley, José Neto
2010	—	`ch.`	Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit
2010	—	`conf`	Securely Connected Facility Location in Metric Graphs. OR Maren Martens, Andreas Bley
2009	J	`jnl`	Approximability of unsplittable shortest path routing problems. Networks Andreas Bley
2009	Misc	`conf`	Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. HPSC Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske
2009	A	`conf`	TOOMAS: Interactive Shopping Guide robots in everyday use - final implementation and experiences from long-term field trials. IROS Horst-Michael Gross, Hans-Joachim Boehme, Christof Schröter, Steffen Müller, Alexander Koenig, Erik Einhorn, Christian Martin, Matthias Merten, Andreas Bley
2008	A	`conf`	An Integer Programming Algorithm for Routing Optimization in IP Networks. ESA Andreas Bley
2008	B	`conf`	ShopBot: Progress in developing an interactive mobile shopping assistant for everyday use. SMC Horst-Michael Gross, Hans-Joachim Böhme, Christof Schröter, Steffen Müller, Alexander König, Christian Martin, Matthias Merten, Andreas Bley
2007	J	`jnl`	Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks Andreas Bley
2007	—	`conf`	Routing and Capacity Optimization for IP Networks. OR Andreas Bley
2006	Misc	`conf`	Integer Programming Approaches to Access and Backbone IP Network Planning. HPSC Andreas Bley, Thorsten Koch
2005	B	`conf`	On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. IPCO Andreas Bley
2003	J	`jnl`	On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. Andreas Bley
1998	—	`conf`	Design of broadband virtual private networks: Model and heuristics for the B-WiN. Robust Communication Networks: Interconnection and Survivability Andreas Bley, Martin Grötschel, Roland Wessäly