Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Facebook. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Twitter. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Google. Yet at activating data is transmitted to third parties.Two clicks for more data protection: Only if you click here, the button will be active and you can send your recommendation to Xing. Yet at activating data is transmitted to third parties.

For timely dissemination of unpublished works, we have a preprint series, the repORts.

Publications


1996

  • M.E. Lübbecke (1996).
    Algorithmen zur Enumeration aller Ecken und Facetten konvexer Polyeder. [bib]

1998

  • K.-P. Bernatzki, M.R. Bussieck, T. Lindner and M.E. Lübbecke (1998).
    Optimal Scrap Combination for Steel Production. OR Spectrum 20: 251-258. [pdf] [doi] [bib]
  • M.R. Bussieck and M.E. Lübbecke (1998).
    The Vertex Set of a 0/1-Polytope is Strongly \(\mathcal{P}\)-Enumerable. Comput. Geom. 11 (2): 103-109. [pdf] [doi] [bib]
  • M.R. Bussieck, M.E. Lübbecke, T. Winter and U.T. Zimmermann (1998).
    Discrete optimization in rail transport. M.R. Bussieck, M.E. Lübbecke, T. Winter and U.T. Zimmermann Proceedings of 11th Baikal International School-Seminar on Optimization Methods and their Applications. Irkutsk, Baikal pp. 225-234. [bib]

2000

  • M.E. Lübbecke and U.T. Zimmermann (2000).
    Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen - vom Bedarf zum Produkt. Arbeitskreis Mathematik in Forschung und Praxis: 18.\ Symposium "`Modellierung und Simulation von Verkehr"', Bad Honnef am 17./18.11.1999. pp. 35-40. [bib]

2001

  • M.E. Lübbecke (2001).
    Engine Scheduling by Column Generation. Dissertation Technische Universität Braunschweig Cuvillier Verlag, Göttingen [bib]
  • M.E. Lübbecke and B. Werners (2001).
    Tagungsbericht OR 2001, Gerhard-Mercator-Universität Duisburg. OR News 13: 35-37. [bib]

2003

  • Th. Epping, W. Hochstättler and M.E. Lübbecke (2003).
    Max Flow Min Cut Duality for a Paint Shop Problem. In U. Leopold-Wildburger, F. Rendl and G. Wäscher (Eds.) Operations Research Proceedings 2002. Springer, Berlin pp. 353-358. [pdf] [bib]
  • M.E. Lübbecke and U.T. Zimmermann (2003).
    Computer Aided Scheduling of Switching Engines. In W. Jäger and H.-J. Krebs (Eds.) Mathematics–Key Technology for the Future: Joint Projects Between Universities and Industry. Springer, Berlin [bib]
  • M.E. Lübbecke and U.T. Zimmermann (2003).
    Engine Routing and Scheduling at Industrial In-Plant Railroads. Transportation Sci. 37 (2): 183-197. [pdf] [doi] [bib]

2004

  • M.R. Bussieck, T. Lindner and M.E. Lübbecke (2004).
    A Fast Algorithm for Near Optimal Line Plans. Math. Methods Oper. Res. 59 (2): 205-220. [pdf] [doi] [bib]
  • S.P. Fekete, M.E. Lübbecke and H. Meijer (2004).
    Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Proceedings of the Fifteenth (SODA). New Orleans, LA pp. 430-439. [pdf] [bib]
  • M.E. Lübbecke (2004).
    Combinatorially Simple Pickup and Delivery Paths. Central European J. Operations Research 12 (4): 405-417. [pdf] [bib]

2005

2006

  • G. Di Stefano, S. Krause, M.E. Lübbecke and U.T. Zimmermann (2006).
    On Minimum \(k\)-Modal Partitions of Permutations. In J.R. Correa, A. Hevia and M. Kiwi (Eds.) Latin American Theoretical Informatics (LATIN). Springer, Berlin Lect. Notes Comput. Sci. 3887: pp. 374-385. [pdf] [doi] [bib]

2007

  • S. Felsner, M.E. Lübbecke and J. Nešetřil (2007).
    Editorial, Selected papers of EuroComb05, Berlin. European J. Combin. 28 (8): 2053-2056. [doi] [bib]
  • S. Felsner, M.E. Lübbecke and J. Nešetřil (2007).
    Preface, Selected papers of EuroComb05, Berlin. Discrete Math. 308 (8): 1347-1349. [doi] [bib]
  • L. Heinrich-Litan and M.E. Lübbecke (2007).
    Rectangle Covers Revisited Computationally. ACM J. Exp. Algorithmics 11: Article No. 2.6. [pdf] [bib]
  • F.G. König, M.E. Lübbecke, R.H. Möhring, G. Schäfer and I. Spenke (2007).
    Solutions to Real-World Instances of PSPACE-Complete Stacking. In L. Arge, M. Hoffmann and E. Welzl (Eds.) Proceedings of the 15th. Springer, Berlin Lect. Notes Comput. Sci. 4698: pp. 729-740. [pdf] [doi] [bib]
  • C. Puhl (2007).
    Robuste Linienplanung und das (s,t)-Path Constrained Network Flow Problem. [bib]

2008

  • A. Ceselli, M.J. Gatto, M.E. Lübbecke, M. Nunkesser and H. Schilling (2008).
    Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Sci. 42 (4): 450-465. [pdf] [doi] [bib]
  • G. Di Stefano, S. Krause, M.E. Lübbecke and U.T. Zimmermann (2008).
    On minimum \(k\)-modal partitions of permutations. J. Discrete Algorithms 6 (3): 381-392. [pdf] [doi] [bib]
  • S.P. Fekete, M.E. Lübbecke and H. Meijer (2008).
    Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete Comput. Geom. 40: 595-621. [pdf] [doi] [bib]
  • F.G. König and M.E. Lübbecke (2008).
    Sorting with Complete Networks of Stacks. In S.-H. Hong, H. Nagamochi and T. Fukunaga (Eds.) Proceedings of the 19th. Springer, Berlin Lect. Notes Comput. Sci. 5369: pp. 896-907. [pdf] [doi] [bib]

Displaying results 1 to 30 out of 101

Page 1

Page 2

Page 3

Page 4

Next >

Copyright Notice: The documents distributed here have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.