column generation, branch-and-price, mixed integer programming, operations research, applications

M.E.Lübbecke and Chr.Puchert
Primal heuristics for branch-and-price algorithms.
PDF

J.Desrosiers, J.-B. Gauthier, and M.E.Lübbecke
Improved column generation for highly degenerate master problems.
PDF

M.Bergner, A.Caprara, A.Ceselli, F.Furini, M.E.Lübbecke, E.Malaguti, and E.Traversi
Generic Dantzig-Wolfe reformulation of mixed integer programs.
Full version of the IPCO2011 paper
PDF

E.T.Coughlan, M.E.Lübbecke, and J.Schulz
A branch-price-and-cut algorithm for multi-mode resource leveling.
Full version of the SEA2010 paper
PDF

M.E.Lübbecke
Automatic decomposition and branch-and-price: A status report.
To appear in R.Klasing (Ed.), Symposium on Experimental Algorithms (SEA 2012), LNCS, 7276, pp. 1-8, Springer, Heidelberg, 2012.
PDF

F.Hennig, B.Nygreen, and M.E.Lübbecke
Nested column generation applied on the crude oil tanker routing and scheduling problem with split pickup and split delivery.
Accepted to Naval Research Logistics.
PDF

G.Lach and M.E.Lübbecke.
Curriculum based course timetabling: New solutions to Udine benchmark instances.
Ann. Oper. Res. 194(1): 255-272, 2012.
DOI: 10.1007/s10479-010-0700-7
PDF

M.Bergner, A.Caprara, F.Furini, M.E.Lübbecke, E.Malaguti, and E.Traversi
Partial convexification of general MIPs by Dantzig-Wolfe reformulation.
In O. Günlük and G.J. Woeginger (Eds.), Integer Programming and Combinatorial Optimization (IPCO 2011), LNCS, 6655, pp. 39-51, 2011, Springer, Berlin.
DOI: 10.1007/978-3-642-20807-2_4
PDF

W.Höhn, F.G.König, M.E.Lübbecke, and R.H.Möhring
Integrated sequencing and scheduling in coil coating.
Management Sci. 57(4):647-666, 2011.
Finalist paper of the EURO Excellence in Practice Award 2009.
DOI: 10.1287/mnsc.1100.1302
PDF

T.Berthold, S.Heinz, M.E.Lübbecke, R.H.Möhring, and J.Schulz
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), LNCS, 6140, pp. 313-317, 2010, Springer, Berlin.
DOI: 10.1007/978-3-642-13520-0_34
PDF

E.T.Coughlan, M.E.Lübbecke, and J.Schulz
A branch-and-price algorithm for multi-mode resource leveling.
In P.Festa (Ed.), Symposium on Experimental Algorithms (SEA 2010), LNCS, 6049, pp. 226-238, 2010, Springer, Berlin.
DOI: 10.1007/978-3-642-13193-6_20
PDF

G.Gamrath and M.E.Lübbecke
Experiments with a generic Dantzig-Wolfe decomposition for integer programs.
In P.Festa (Ed.), Symposium on Experimental Algorithms (SEA 2010), LNCS, 6049, pp. 239-252, 2010, Springer, Berlin.
DOI: 10.1007/978-3-642-13193-6_21
PDF

A.Ceselli, M.J.Gatto, M.E.Lübbecke, M.Nunkesser, and H.Schilling.
Optimizing the cargo express service of Swiss Federal Railways.
Transportation Sci. 42(4):450-465, 2008.
DOI: 10.1287/trsc.1080.0246
PDF BibTeX

F.G.König and M.E.Lübbecke.
Sorting with complete networks of stacks.
In S.-H.Hong and H.Nagamochi and T.Fukunaga (Eds.), International Symposium on Algorithms and Computation (ISAAC 2008), LNCS, 5369, pp. 896-907, 2008, Springer, Berlin.
DOI: 10.1007/978-3-540-92182-0_78
PDF BibTeX

S.P.Fekete, M.E.Lübbecke, and H.Meijer.
Minimizing the stabbing number of matchings, trees, and triangulations.
Discrete and Computational Geometry 40: 595-621, 2008
Full version of the SODA2004 paper
DOI: 10.1007/s00454-008-9114-6
PDF BibTeX MathSciNet

G.Di Stefano, S.Krause, M.E.Lübbecke, and U.T.Zimmermann.
On minimum k-modal partitions of permutations.
Journal of Discrete Algorithms 6(3):381-392, 2008
Full version of the LATIN2006 paper
DOI: 10.1016/j.jda.2008.01.002
PDF BibTeX MathSciNet

G.Lach and M.E.Lübbecke.
Optimal university course timetables and the partial transversal polytope.
In C.C.McGeoch (Ed.), Workshop on Experimental Algorithms (WEA 2008), LNCS, 5038, pp. 235-248, 2008, Springer, Berlin.
DOI: 10.1007/978-3-540-68552-4_18
PDF BibTeX

F.G.König, M.E.Lübbecke, R.H.Möhring, G.Schäfer, and I.Spenke.
Solutions to real-world instances of PSPACE-complete stacking.
In L.Arge, M.Hoffmann, and E.Welzl (Eds.), European Symposium on Algorithms (ESA 07), LNCS, 4698, pp. 729-740, 2007, Springer, Berlin.
DOI: 10.1007/978-3-540-75520-3_64
PDF BibTeX

L.Heinrich-Litan and M.E.Lübbecke.
Rectangle covers revisited computationally.
ACM Journal of Experimental Algorithmics 11: Article No. 2.6, 2007
Full version of the WEA 2005 paper
PDF BibTeX MathSciNet

G.Di Stefano, S.Krause, M.E.Lübbecke, and U.T.Zimmermann.
On minimum k-modal partitions of permutations.
In J.R.Correa, A.Hevia, and M.Kiwi (Eds.), Latin American Theoretical Informatics (LATIN 2006), LNCS, 3887, pp.374-385, 2006. Springer, Berlin.
DOI: 10.1007/11682462_36
PDF BibTeX MathSciNet

J.Desrosiers and M.E.Lübbecke.
Selected topics in column generation.
Oper. Res. 53(6):1007-1023, 2005.
DOI: 10.1287/opre.1050.0234
PDF BibTeX MathSciNet

D.Villeneuve, J.Desrosiers, M.E.Lübbecke, and F.Soumis
On compact formulations for integer programs solved by column generation.
Ann. Oper. Res., 139(1):375-388, 2005.
Issue on Integer Programming - The State of the Art, M.Guignard and K.Spielberg (Eds.)
DOI: 10.1007/s10479-005-3455-9
PDF BibTeX MathSciNet

M.E.Lübbecke and U.T.Zimmermann.
Shunting minimal rail car allocation.
Comput. Optim. Appl., 31(3):295-308, 2005.
DOI: 10.1007/s10589-005-3229-y
PDF BibTeX MathSciNet

L.Heinrich-Litan and M.E.Lübbecke.
Rectangle covers revisited computationally.
In S.E.Nikoletseas (Ed.), 4th International Workshop on Efficient and Experimental Algorithms (WEA 05), LNCS, 3503, pp.55-66, 2005. Springer, Berlin.
DOI: 10.1007/11427186_7
PDF BibTeX

M.E.Lübbecke.
Dual variable based fathoming in dynamic programs for column generation.
European J. Oper. Res., 162(1):122-125, 2005.
Special issue on Logistics: From Theory to Application, S.Martello and E.Pesch (Eds.).
DOI: 10.1016/j.ejor.2003.05.006
PDF BibTeX MathSciNet

M.E.Lübbecke.
Combinatorially simple pickup and delivery paths.
Central European J. Oper. Res., 12(4):405-417, 2004.
PDF BibTeX MathSciNet

M.R.Bussieck, T.Lindner, and M.E.Lübbecke.
A fast algorithm for near optimal line plans.
Math. Methods Oper. Res., 59(2):205-220, 2004.
DOI: 10.1007/s001860300332
PDF BibTeX MathSciNet

S.P.Fekete, M.E.Lübbecke, and H.Meijer.
Minimizing the stabbing number of matchings, trees, and triangulations.
In Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), New Orleans, LA, pp.430-439
PDF BibTeX MathSciNet

Th.Epping, W.Hochstättler, and M.E.Lübbecke.
Max flow min cut duality for a paint shop problem.
In Operations Research Proceedings 2002, U.Leopold-Wildburger, F.Rendl, and G.Wäscher (Eds.), Berlin. Springer, 2003, pp.353-358.
PDF BibTeX

M.E.Lübbecke and U.T.Zimmermann.
Engine routing and scheduling at industrial in-plant railroads.
Transportation Sci., 37(2):183-197, 2003.
DOI: 10.1287/trsc.37.2.183.15251
PDF BibTeX

K.-P.Bernatzki, M.R.Bussieck, T.Lindner, and M.E.Lübbecke.
Optimal scrap combination for steel production.
OR Spectrum, 20:251-258, 1998.
DOI: 10.1007/s002910050072
PDF BibTeX

M.R.Bussieck and M.E.Lübbecke.
The vertex set of a 0/1-polytope is strongly P-enumerable.
Comput. Geom., 11(2):103-109, 1998.
DOI: 10.1016/S0925-7721(98)00021-2
PDF BibTeX MathSciNet zerOne homepage

M.E.Lübbecke
Column Generation.
In J.J.Cochran (Ed.), Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, 2011.
DOI: 10.1002/9780470400531.eorms0158
PDF

J.Desrosiers and M.E.Lübbecke
Branch-price-and-cut algorithms.
In J.J.Cochran (Ed.), Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, 2011.
DOI: 10.1002/9780470400531.eorms0118
PDF

T.Erlebach and M.E.Lübbecke (Eds.)
Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS2010)
OpenAccess Series in Informatics (OASIcs), vol.14, Schloss Dagstuhl: Leibniz-Zentrum für Informatik.
DOI: 10.4230/OASIcs.ATMOS.2010.i

Chr.Liebchen, M.E.Lübbecke, R.H.Möhring, and S.Stiller.
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
In R.K.Ahuja, R.H.Möhring, and C.D.Zaroliagis (Eds.), Robust and Online Large-Scale Optimization, LNCS, 5868, pp.1-27, 2009. Springer, Berlin.
DOI: 10.1007/978-3-642-05465-5_1
PDF BibTeX

S.Felsner, M.E.Lübbecke, and J.Nešetřil.
Preface. Selected papers from EuroComb05.
Discrete Mathematics, 308(8), 1347-1349, 2008.
DOI: 10.1016/j.disc.2007.09.029
PDF BibTeX

S.Felsner, M.E.Lübbecke, and J.Nešetřil.
Editorial. Selected papers from EuroComb05.
European Journal of Combinatorics, 28(8): 2053-2056, 2007.
DOI: 10.1016/j.ejc.2007.04.003
 PDF BibTeX

J.Desrosiers and M.E.Lübbecke.
A primer in column generation.
In Column Generation, G.Desaulniers, J.Desrosiers, and M.M.Solomon (Eds.), Springer, 2005, pp.1-32.
DOI: 10.1007/0-387-25486-2_1
PDF BibTeX

M.E.Lübbecke and U.T.Zimmermann.
Computer aided scheduling of switching engines.
In Mathematics-Key Technology for the Future: Joint Projects Between Universities and Industry, W.Jäger and H.-J.Krebs (Eds.), Springer, Berlin, 2003, pp.690-702.
PDF BibTeX

Habilitation thesis: Computational Mixed Integer Programming
TU Berlin, June 2007.

PhD thesis: Engine Scheduling by Column Generation
Cuvillier Göttingen, ISBN 3-89873-178-2, 2001.
PDF BibTeX

Master's thesis: Algorithmen zur Enumeration aller Ecken und Facetten konvexer Polyeder, 1996.
PDF BibTeX

M.E.Lübbecke and B.Werners.
Tagungsbericht OR 2001, Gerhard-Mercator-Universität Duisburg.
OR News, 13:35-37, 2001.
PDF

M.E.Lübbecke and U.T.Zimmermann.
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen - vom Bedarf zum Produkt.
In Arbeitskreis Mathematik in Forschung und Praxis: 18. Symposium "Modellierung und Simulation von Verkehr", Bad Honnef am 17./18.11.1999, 2000, pp.35-40.
PDF BibTeX

M.R.Bussieck, M.E.Lübbecke, T.Winter, and U.T.Zimmermann.
Discrete optimization in rail transport.
In V.Bulatov, Ed., Proceedings of 11th Baikal International School-Seminar on Optimization Methods and their Applications, pp. 225--234, Irkutsk, Baikal, 1998.
PDF BibTeX

M.R.Bussieck, A.Fink, and M.E.Lübbecke.
Yet another note on ``An efficient zero-one formulation of the multilevel lot-sizing problem''.
Braunschweig University of Technology, 1998.
PDF BibTeX

H.Mosemann, F.Röhrdanz, and M.E.Lübbecke.
Computing all stable orientations of assemblies with the double description method.
Braunschweig University of Technology, 1996.
PostScript

M.E.Lübbecke
Approximationsalgorithmen (German)
Technical University Berlin, winter term 2006/07.
PDF

Copyright Notice
These documents 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.

Last modified: Mon Apr 23 20:13:25 CEST 2012 Valid CSS!