Marco E. Lübbecke

	2012
28		Marco E. Lübbecke: Automatic Decomposition and Branch-and-Price - A Status Report. SEA 2012: 1-8
27		Gerald Lach, Marco E. Lübbecke: Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals OR 194(1): 255-272 (2012)
	2011
26		Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi: Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51
25		Wiebke Höhn, Felix G. König, Rolf H. Möhring, Marco E. Lübbecke: Integrated Sequencing and Scheduling in Coil Coating. Management Science 57(4): 647-666 (2011)
	2010
24		Thomas Erlebach, Marco E. Lübbecke: ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2010
23		Thomas Erlebach, Marco E. Lübbecke: Frontmatter, Table of Contents, Preface, Organization. ATMOS 2010
22		Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz: A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317
21		Eamonn T. Coughlan, Marco E. Lübbecke, Jens Schulz: A Branch-and-Price Algorithm for Multi-mode Resource Leveling. SEA 2010: 226-238
20		Gerald Gamrath, Marco E. Lübbecke: Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. SEA 2010: 239-252
	2009
19		Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27
	2008
18		Felix G. König, Marco E. Lübbecke: Sorting with Complete Networks of Stacks. ISAAC 2008: 895-906
17		Gerald Lach, Marco E. Lübbecke: Optimal University Course Timetables and the Partial Transversal Polytope. WEA 2008: 235-248
16		Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete & Computational Geometry 40(4): 595-621 (2008)
15		Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Preface. Discrete Mathematics 308(8): 1347-1349 (2008)
14		Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann: On minimum k-modal partitions of permutations. J. Discrete Algorithms 6(3): 381-392 (2008)
13		Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling: Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Science 42(4): 450-465 (2008)
	2007
12		Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke: Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA 2007: 729-740
11		Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007)
	2006
10		Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann: On Minimum k-Modal Partitions of Permutations. LATIN 2006: 374-385
9		Laura Heinrich-Litan, Marco E. Lübbecke: Rectangle covers revisited computationally. ACM Journal of Experimental Algorithmics 11: (2006)
	2005
8		Laura Heinrich-Litan, Marco E. Lübbecke: Rectangle Covers Revisited Computationally. WEA 2005: 55-66
7		Daniel Villeneuve, Jacques Desrosiers, Marco E. Lübbecke, François Soumis: On Compact Formulations for Integer Programs Solved by Column Generation. Annals OR 139(1): 375-388 (2005)
6		Marco E. Lübbecke: Dual variable based fathoming in dynamic programs for column generation. European Journal of Operational Research 162(1): 122-125 (2005)
5		Marco E. Lübbecke, Jacques Desrosiers: Selected Topics in Column Generation. Operations Research 53(6): 1007-1023 (2005)
	2004
4		Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446
	2003
3		Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer: Minimizing the stabbing number of matchings, trees, and triangulations CoRR cs.CG/0310034: (2003)
2		Marco E. Lübbecke, Uwe T. Zimmermann: Engine Routing and Scheduling at Industrial In-Plant Railroads. Transportation Science 37(2): 183-197 (2003)
	1998
1		Michael R. Bussieck, Marco E. Lübbecke: The vertex set of a 0/1-polytope is strongly P-enumerable. Comput. Geom. 11(2): 103-109 (1998)

Coauthor Index

1	Martin Bergner	[26]
2	Timo Berthold	[22]
3	Michael R. Bussieck	[1]
4	Alberto Caprara	[26]
5	Alberto Ceselli	[13]
6	Eamonn T. Coughlan	[21]
7	Jacques Desrosiers	[5] [7]
8	Thomas Erlebach	[23] [24]
9	Sándor P. Fekete	[3] [4] [16]
10	Stefan Felsner	[11] [15]
11	Fabio Furini	[26]
12	Gerald Gamrath	[20]
13	Michael Gatto	[13]
14	Laura Heinrich-Litan	[8] [9]
15	Stefan Heinz	[22]
16	Wiebke Höhn	[25]
17	Felix G. König	[12] [18] [25]
18	Stefan Krause	[10] [14]
19	Gerald Lach	[17] [27]
20	Christian Liebchen	[19]
21	Enrico Malaguti	[26]
22	Henk Meijer	[3] [4] [16]
23	Rolf H. Möhring	[12] [19] [22] [25]
24	Jaroslav Nesetril (Jarik Nesetril)	[11] [15]
25	Marc Nunkesser	[13]
26	Guido Schäfer	[12]
27	Heiko Schilling	[13]
28	Jens Schulz	[21] [22]
29	François Soumis	[7]
30	Ines Spenke	[12]
31	Gabriele Di Stefano	[10] [14]
32	Sebastian Stiller	[19]
33	Emiliano Traversi	[26]
34	Daniel Villeneuve	[7]
35	Uwe T. Zimmermann	[2] [10] [14]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page