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


2010

  • T. Berthold, S. Heinz, M.E. Lübbecke, R.H. Möhring and J. Schulz (2010).
    A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. In A. Lodi, M. Milano and P. Toth (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010). Springer, Berlin Lect. Notes Comput. Sci. 6140: pp. 313-317. [pdf] [doi] [bib]
  • E.T. Coughlan, M.E. Lübbecke and J. Schulz (2010).
    A Branch-and-Price Algorithm for Multi-Mode Resource Leveling. E.T. Coughlan, M.E. Lübbecke and J. Schulz Experimental Algorithms. Springer, Berlin Lect. Notes Comput. Sci. 6049: pp. 226-238. [pdf] [doi] [bib]
  • (2010).
    Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. In T. Erlebach and M. Lübbecke (Eds.) Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany [doi] [bib]
  • T. Erlebach and M. Lübbecke (2010).
    Preface. In T. Erlebach and M. Lübbecke (Eds.) Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany OpenAccess Series in Informatics (OASIcs) 14: pp. i-ix. [pdf] [doi] [www] [bib]
  • G. Gamrath and M.E. Lübbecke (2010).
    Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. G. Gamrath and M.E. Lübbecke Experimental Algorithms. Springer, Berlin Lect. Notes Comput. Sci. 6049: pp. 239-252. [pdf] [doi] [bib]
  • C. Büsing (2010).
    Graphen- und Netzwerkoptimierung. Spektrum Akademischer Verlag, [bib]
  • C. Büsing and J. Maue (2010).
    Robust Algorithms for Sorting Railway Cars. In de Berg, M. and Meyer, U. (Eds.) Algorithms - ESA 2010. Springer, Berlin, Lect. Notes Comput. Sci. 6346: pp. 350-361. [doi] [bib]

2009

  • Chr. Liebchen, M.E. Lübbecke, R.H. Möhring and S. Stiller (2009).
    The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In R.K. Ahuja, R.H. Möhring and Chr. Zaroliagis (Eds.) Robust and Online Large-Scale Optimization. Springer, Berlin [pdf] [doi] [bib]
  • C. Büsing (2009).
    The Exact Subgraph Recoverable Robust Shortest Path Problem. Robust and Online Large-Scale Optimization. Springer, Berlin, Lect. Notes Comput. Sci. 5868: pp. 231-248. [doi] [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]
  • G. Lach and M.E. Lübbecke (2008).
    Optimal University Course Timetables and the Partial Transversal Polytope. G. Lach and M.E. Lübbecke Proceedings of the 7th. Springer, Berlin Lect. Notes Comput. Sci. 5038: pp. 235-248. [pdf] [doi] [bib]
  • M.E. Lübbecke (2008).
    Computational Mixed Integer Programming. Kumulative Habilitationsschrift TU Berlin, Fakultät Mathematik und Naturwissenschaften [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]

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]

2005

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]

Displaying results 61 to 90 out of 101

< Previous

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.