Andreas Bley

	2012
14		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)
	2011
13		Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer: MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502
12		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
11		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
10		Andreas Bley: An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica 60(1): 21-45 (2011)
	2010
9		Andreas Bley, Jose Neto: Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. IPCO 2010: 205-218
8		Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland: A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Computers & OR 37(9): 1641-1647 (2010)
	2009
7		Horst-Michael Gross, H. 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
6		Andreas Bley: Approximability of unsplittable shortest path routing problems. Networks 54(1): 23-46 (2009)
	2008
5		Andreas Bley: An Integer Programming Algorithm for Routing Optimization in IP Networks. ESA 2008: 198-209
	2007
4		Andreas Bley: Routing and Capacity Optimization for IP Networks. OR 2007: 9-16
3		Andreas Bley: Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1): 29-36 (2007)
	2005
2		Andreas Bley: On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. IPCO 2005: 97-110
	2003
1		Andreas Bley: On the complexity of vertex-disjoint length-restricted path problems. Computational Complexity 12(3-4): 131-149 (2003)

Coauthor Index

1	Ashwin Arulselvan	[13]
2	H. Boehme	[7]
3	Natashia Boland	[8] [14]
4	Erik Einhorn	[7] [11] [12]
5	Christopher Fricke	[8] [14]
6	Gary Froyland	[8] [14]
7	Stefan Gollowitzer	[13]
8	Horst-Michael Groß (Horst-Michael Gross)	[7] [11] [12]
9	Alexander Koenig	[7]
10	Tim Langner	[11] [12]
11	Ivana Ljubic	[13]
12	Christian Martin	[7] [11] [12]
13	Olaf Maurer	[13]
14	Matthias Merten	[7] [11] [12]
15	Steffen Müller	[7] [11] [12]
16	Jose Neto	[9]
17	Christof Schröter	[7] [11] [12]
18	Renata Sotirov	[14]
19	Michael Volkhardt	[11] [12]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page