Prof. Dr. Marco Lübbecke
Office:
B262
Fon:
Email:
Office hours:
On Wednesdays, 11.00-12.00
For the time being, office hours are online only; please send an email for an appointment.
Other profiles on the web:
Publications
Steever, Z., Murray, Ch., Yuan, J., Karwan, M. and Lübbecke, M.
An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs. INFORMS Journal on Computing, March 2022. Online First.
An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs. INFORMS Journal on Computing, March 2022. Online First.
Lübbecke, M.
Die Mathematik der Entscheidungen. RWTH Themen - das Forschungsmagazin der RWTH, February 2021.
Die Mathematik der Entscheidungen. RWTH Themen - das Forschungsmagazin der RWTH, February 2021.
Lübbecke, M., Maher, S.J. and Witt, J.T.
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. Discrete Optimization, 39:100626, February 2021.
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. Discrete Optimization, 39:100626, February 2021.
Gleixner, A.M., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J.T., Lübbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D. and Shinano, Y.
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Mathematical Programming Computation, 13:443—490, January 2021.
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Mathematical Programming Computation, 13:443—490, January 2021.
Bastubbe, M. and Lübbecke, M.
A Branch-and-Price Algorithm for Capacitated Hypergraph Vertex Separation. Mathematical Programming Computation, 12:39—68, March 2020.
A Branch-and-Price Algorithm for Capacitated Hypergraph Vertex Separation. Mathematical Programming Computation, 12:39—68, March 2020.
Lübbecke, M. and Pardalos, P.M.
Welcome to SN Operations Research Forum!. SN Operations Research Forum, 1(1):1, February 2020.
Welcome to SN Operations Research Forum!. SN Operations Research Forum, 1(1):1, February 2020.
Lübbecke, E., Lübbecke, M. and Möhring, R.
Ship Traffic Optimization for the Kiel Canal. Operations Research, 67(3):791–812, May 2019.
Ship Traffic Optimization for the Kiel Canal. Operations Research, 67(3):791–812, May 2019.
Goderbauer, S. and Lübbecke, M.
Reform der Bundestagswahlkreise: Unterstützung durch mathematische Optimierung. Zeitschrift für Parlamentsfragen, 50(1):3—21, April 2019.
Reform der Bundestagswahlkreise: Unterstützung durch mathematische Optimierung. Zeitschrift für Parlamentsfragen, 50(1):3—21, April 2019.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Vector Space Decomposition for Solving Large-Scale Linear Programs. Operations Research, 66(5):1376—1389, September 2018.
Vector Space Decomposition for Solving Large-Scale Linear Programs. Operations Research, 66(5):1376—1389, September 2018.
Witt, J.T., Lübbecke, M. and Reed, B.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Mathematical Programming, 171(1—2):519—522, September 2018.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Mathematical Programming, 171(1—2):519—522, September 2018.
Lübbecke, M. and Witt, J.T.
The strength of Dantzig–Wolfe reformulations for the stable set and related problems. Discrete Optimization, 30:168—187, August 2018.
The strength of Dantzig–Wolfe reformulations for the stable set and related problems. Discrete Optimization, 30:168—187, August 2018.
Brinker, J., Ring, D., Lübbecke, M., Takeda, Y. and Corves, B.
Optimization of the Reconfiguration Planning of Cyber-Physical Production Systems with Delta-Like Architecture. Int. Conf. on Reconfigurable Mechanisms & Robots (ReMAR), June 2018. IEEE.
Optimization of the Reconfiguration Planning of Cyber-Physical Production Systems with Delta-Like Architecture. Int. Conf. on Reconfigurable Mechanisms & Robots (ReMAR), June 2018. IEEE.
Bastubbe, M., Lübbecke, M. and Witt, J.T.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. In D'Angelo, G., Experimental Algorithms - SEA 2018, pages 11:1—11:12, May 2018. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics (LIPIcs), vol. 103 (instances available at https://www.or.rwth-aachen.de/files/research/publications/alldecomps_instances.zip).
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. In D'Angelo, G., Experimental Algorithms - SEA 2018, pages 11:1—11:12, May 2018. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics (LIPIcs), vol. 103 (instances available at https://www.or.rwth-aachen.de/files/research/publications/alldecomps_instances.zip).
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
A strongly polynomial Contraction-Expansion algorithm for network flow problems. Computers & Operations Research, 84:16—32, August 2017.
A strongly polynomial Contraction-Expansion algorithm for network flow problems. Computers & Operations Research, 84:16—32, August 2017.
Brinker, J., Lübbecke, M., Takeda, Y. and Corves, B.
Optimization of the Reconfiguration Planning of Handling Systems based on Parallel Manipulators with Delta-Like Architecture. IEEE Robotics and Automation Letters, 2(3):1802—1808, July 2017.
Optimization of the Reconfiguration Planning of Handling Systems based on Parallel Manipulators with Delta-Like Architecture. IEEE Robotics and Automation Letters, 2(3):1802—1808, July 2017.
Kruber, M., Lübbecke, M. and Parmentier, A.
Learning When to Use a Decomposition. In Salvagnin, D. and Lombardi, M., Integration of AI and OR Techniques in Constraint Programming, pages 202—210, May 2017. Springer. Lecture Notes in Computer Science, vol 10335.
Learning When to Use a Decomposition. In Salvagnin, D. and Lombardi, M., Integration of AI and OR Techniques in Constraint Programming, pages 202—210, May 2017. Springer. Lecture Notes in Computer Science, vol 10335.
Goderbauer, S., Bahl, B., Voll, P., Lübbecke, M., Bardow, A. and Koster, A.M.C.A.
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Computers & Chemical Engineering, 95:38—48, December 2016.
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Computers & Chemical Engineering, 95:38—48, December 2016.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Tools for primal degenerate linear programs: IPS, DCA, and PE. EURO Journal on Transportation and Logistics, 5(2):161—204, June 2016.
Tools for primal degenerate linear programs: IPS, DCA, and PE. EURO Journal on Transportation and Logistics, 5(2):161—204, June 2016.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. Journal of Experimental Algorithmics (JEA), 21:1.2:1—1.2:16, January 2016.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. Journal of Experimental Algorithmics (JEA), 21:1.2:1—1.2:16, January 2016.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
About the minimum mean cycle-canceling algorithm. Discrete Applied Mathematics, 196:115—134, December 2015.
About the minimum mean cycle-canceling algorithm. Discrete Applied Mathematics, 196:115—134, December 2015.
Coughlan, E.T., Lübbecke, M. and Schulz, J.
A branch-price-and-cut algorithm for multi-mode resource leveling. European Journal of Operational Research, 245(1):70—80, October 2015.
A branch-price-and-cut algorithm for multi-mode resource leveling. European Journal of Operational Research, 245(1):70—80, October 2015.
Lübbecke, M.
Comments on: An overview of curriculum-based course timetabling. TOP, 23(2):359—361, July 2015.
Comments on: An overview of curriculum-based course timetabling. TOP, 23(2):359—361, July 2015.
Lübbecke, M. and Witt, J.T.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. In Bampis, E., Experimental Algorithms - SEA 2015, pages 110—121, June 2015. Springer. Lecture Notes in Computer Science, vol 9125.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. In Bampis, E., Experimental Algorithms - SEA 2015, pages 110—121, June 2015. Springer. Lecture Notes in Computer Science, vol 9125.
Bergner, M., Caprara, A., Ceselli, A., Furini, F., Lübbecke, M., Malaguti, E. and Traversi, E.
Automatic Dantzig–Wolfe reformulation of mixed integer programs. Mathematical Programming, 149(1—2):391—424, January 2015.
Automatic Dantzig–Wolfe reformulation of mixed integer programs. Mathematical Programming, 149(1—2):391—424, January 2015.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Decomposition theorems for linear programs. Operations Research Letters, 42(8):553—557, December 2014.
Decomposition theorems for linear programs. Operations Research Letters, 42(8):553—557, December 2014.
Desrosiers, J., Gauthier, J.-B. and Lübbecke, M.
Row-reduced column generation for degenerate master problems. European Journal of Operational Research, 236(2):453—460, July 2014.
Row-reduced column generation for degenerate master problems. European Journal of Operational Research, 236(2):453—460, July 2014.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In Gudmundsson, J. and Katajainen, J., Experimental Algorithms - SEA 2014, pages 34—45, June 2014. Springer. Lecture Notes in Computer Science, vol 8504.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In Gudmundsson, J. and Katajainen, J., Experimental Algorithms - SEA 2014, pages 34—45, June 2014. Springer. Lecture Notes in Computer Science, vol 8504.
Kirchner, S. and Lübbecke, M.
Dynamische Vergabe von Patiententerminen in Krankenhäusern. In Lübbecke, M., Weiler, A. and Werners, B., Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale, pages 83—96, April 2014. Springer.
Dynamische Vergabe von Patiententerminen in Krankenhäusern. In Lübbecke, M., Weiler, A. and Werners, B., Zukunftsperspektiven des Operations Research: Erfolgreicher Einsatz und Potenziale, pages 83—96, April 2014. Springer.
Lübbecke, M.
Automatic Decomposition and Branch-and-Price---A Status Report. Experimental Algorithms (SEA), pages 1—8, June 2012. Springer. Lecture Notes in Computer Science, vol 7276.
Automatic Decomposition and Branch-and-Price---A Status Report. Experimental Algorithms (SEA), pages 1—8, June 2012. Springer. Lecture Notes in Computer Science, vol 7276.
Hennig, F., Nygreen, B. and Lübbecke, M.
Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Research Logistics, 59(3—4):298—310, April 2012.
Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Research Logistics, 59(3—4):298—310, April 2012.
Lach, G. and Lübbecke, M.
Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1):255—272, April 2012.
Curriculum based course timetabling: new solutions to Udine benchmark instances. Annals of Operations Research, 194(1):255—272, April 2012.
Bergner, M., Caprara, A., Furini, F., Lübbecke, M., Malaguti, E. and Traversi, E.
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. In Günlük, O. and Woeginger, G.J., Integer Programming and Combinatoral Optimization (IPCO), pages 39—51, June 2011. Springer. Lecture Notes in Computer Science, vol 6655.
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. In Günlük, O. and Woeginger, G.J., Integer Programming and Combinatoral Optimization (IPCO), pages 39—51, June 2011. Springer. Lecture Notes in Computer Science, vol 6655.
Höhn, W., König, F.G., Möhring, R. and Lübbecke, M.
Integrated Sequencing and Scheduling in Coil Coating. Management Science, 57(4):647—666, April 2011.
Integrated Sequencing and Scheduling in Coil Coating. Management Science, 57(4):647—666, April 2011.
Desrosiers, J. and Lübbecke, M.
Branch-Price-and-Cut Algorithms. In Cochran, J.J., Encyclopedia of Operations Research and Management Science. John Wiley & Sons, January 2011.
Branch-Price-and-Cut Algorithms. In Cochran, J.J., Encyclopedia of Operations Research and Management Science. John Wiley & Sons, January 2011.
Lübbecke, M.
Column Generation. In Lübbecke, M., Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, January 2011.
Column Generation. In Lübbecke, M., Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester, January 2011.
Erlebach, T. and Lübbecke, M.
Preface. In Erlebach, T. and Lübbecke, M., Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pages i—ix, September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Preface. In Erlebach, T. and Lübbecke, M., Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pages i—ix, September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Erlebach, T. and Lübbecke, M.
Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). OpenAccess Series in Informatics (OASIcs), September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). OpenAccess Series in Informatics (OASIcs), September 2010. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Berthold, T., Heinz, S., Lübbecke, M., Möhring, R. and Schulz, J.
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. In Lodi, A., Milano, M. and Toth, P., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 313—317, June 2010. Springer. Lecture Notes in Computer Science, vol 6140.
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. In Lodi, A., Milano, M. and Toth, P., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 313—317, June 2010. Springer. Lecture Notes in Computer Science, vol 6140.
Coughlan, E.T., Lübbecke, M. and Schulz, J.
A Branch-and-Price Algorithm for Multi-mode Resource Leveling. In Festa, P., Experimental Algorithms (SEA), pages 226—238, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
A Branch-and-Price Algorithm for Multi-mode Resource Leveling. In Festa, P., Experimental Algorithms (SEA), pages 226—238, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
Gamrath, G. and Lübbecke, M.
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. In Festa, P., Experimental Algorithms (SEA), pages 239—252, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. In Festa, P., Experimental Algorithms (SEA), pages 239—252, May 2010. Springer. Lecture Notes in Computer Science, vol 6049.
Liebchen, C., Lübbecke, M., Möhring, R. and Stiller, S.
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In Ahuja, R.K., Möhring, R. and Zaroliagis, C., Robust and Online Large-Scale Optimization. pages 1—27, Springer, January 2009. Lecture Notes in Computer Science, vol 5868.
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In Ahuja, R.K., Möhring, R. and Zaroliagis, C., Robust and Online Large-Scale Optimization. pages 1—27, Springer, January 2009. Lecture Notes in Computer Science, vol 5868.
König, F.G. and Lübbecke, M.
Sorting with Complete Networks of Stacks. In Hong, S., Nagamochi, H. and Fukunaga, T., Algorithms and Computation (ISAAC), pages 895—906, December 2008. Springer. Lecture Notes in Computer Science, vol 5369.
Sorting with Complete Networks of Stacks. In Hong, S., Nagamochi, H. and Fukunaga, T., Algorithms and Computation (ISAAC), pages 895—906, December 2008. Springer. Lecture Notes in Computer Science, vol 5369.
Ceselli, A., Gatto, M., Lübbecke, M., Nunkesser, M. and Schilling, H.
Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Science, 42(4):450 — 465, November 2008.
Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Science, 42(4):450 — 465, November 2008.
Fekete, S., Lübbecke, M. and Meijer, H.
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete & Computational Geometry, 40:595—621, October 2008.
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discrete & Computational Geometry, 40:595—621, October 2008.
Di Stefano, G., Krause, S., Lübbecke, M. and Zimmermann, U.
On minimum k-modal partitions of permutations. Journal of Discrete Algorithms, 6(3):381—392, August 2008.
On minimum k-modal partitions of permutations. Journal of Discrete Algorithms, 6(3):381—392, August 2008.
Lach, G. and Lübbecke, M.
Optimal University Course Timetables and the Partial Transversal Polytope. In McGeoch, C., Experimental Algorithms (WEA), pages 235—248, May 2008. Springer. Lecture Notes in Computer Science, vol 5038.
Optimal University Course Timetables and the Partial Transversal Polytope. In McGeoch, C., Experimental Algorithms (WEA), pages 235—248, May 2008. Springer. Lecture Notes in Computer Science, vol 5038.
Felsner, S., Lübbecke, M. and Nešetřil, J.
Preface. Discrete Mathematics, 308(8):1347—1349, November 2007.
Preface. Discrete Mathematics, 308(8):1347—1349, November 2007.
Felsner, S., Lübbecke, M. and Nešetřil, J.
Editorial. European Journal of Combinatorics, 28(8):2053—2056, November 2007.
Editorial. European Journal of Combinatorics, 28(8):2053—2056, November 2007.
König, F.G., Lübbecke, M., Möhring, R., Schäfer, G. and Spenke, I.
Solutions to Real-World Instances of PSPACE-Complete Stackin. In Arge, L., Hoffmann, M. and Welzl, E., Algorithms (ESA), pages 729—740, October 2007. Springer. Lecture Notes in Computer Science, vol 4698.
Solutions to Real-World Instances of PSPACE-Complete Stackin. In Arge, L., Hoffmann, M. and Welzl, E., Algorithms (ESA), pages 729—740, October 2007. Springer. Lecture Notes in Computer Science, vol 4698.
Heinrich-Litan, L. and Lübbecke, M.
Rectangle covers revisited computationally. Journal of Experimental Algorithmics, 11:Article 2.6, February 2007.
Rectangle covers revisited computationally. Journal of Experimental Algorithmics, 11:Article 2.6, February 2007.
Di Stefano, G., Krause, S., Lübbecke, M. and Zimmermann, U.
On minimum k-modal partitions of permutations. In Correa, J., Hevia, A. and Kiwi, M., Theoretical Informatics (LATIN), pages 374—385, March 2006. Springer. Lecture Notes in Computer Science, vol 3887.
On minimum k-modal partitions of permutations. In Correa, J., Hevia, A. and Kiwi, M., Theoretical Informatics (LATIN), pages 374—385, March 2006. Springer. Lecture Notes in Computer Science, vol 3887.
Desrosiers, J. and Lübbecke, M.
Selected Topics in Column Generation. Operations Research, 53(6):1007—1023, December 2005.
Selected Topics in Column Generation. Operations Research, 53(6):1007—1023, December 2005.
Villeneuve, D., Desrosiers, J., Lübbecke, M. and Soumis, F.
Compact Formulations for Integer Programs Solved by Column Generation. Annals of Operations Research, 139(1):375–388, October 2005.
Compact Formulations for Integer Programs Solved by Column Generation. Annals of Operations Research, 139(1):375–388, October 2005.
Lübbecke, M. and Zimmermann, U.
Shunting Minimal Rail Car Allocation. Computational Optimization and Applications, 31(3):295–308, July 2005.
Shunting Minimal Rail Car Allocation. Computational Optimization and Applications, 31(3):295–308, July 2005.
Heinrich-Litan, L. and Lübbecke, M.
Rectangle Covers Revisited Computationally. In Nikoletseas, S., Experimental and Efficient Algorithms (WEA), pages 55—66, May 2005. Springer. Lecture Notes in Computer Science, vol 3503.
Rectangle Covers Revisited Computationally. In Nikoletseas, S., Experimental and Efficient Algorithms (WEA), pages 55—66, May 2005. Springer. Lecture Notes in Computer Science, vol 3503.
Lübbecke, M.
Dual variable based fathoming in dynamic programs for column generation. European Journal of Operational Research, 162(1):122—125, April 2005.
Dual variable based fathoming in dynamic programs for column generation. European Journal of Operational Research, 162(1):122—125, April 2005.
Desrosiers, J. and Lübbecke, M.
A Primer in Column Generation. In Desaulniers, G., Desrosiers, J. and Solomon, M.M., Column Generation. chapter 1, pages 1—32, Springer US, January 2005.
A Primer in Column Generation. In Desaulniers, G., Desrosiers, J. and Solomon, M.M., Column Generation. chapter 1, pages 1—32, Springer US, January 2005.
Lübbecke, M.
Combinatorially Simple Pickup and Delivery Paths. Central European Journal of Operations Research, 12(4):405—417, October 2004.
Combinatorially Simple Pickup and Delivery Paths. Central European Journal of Operations Research, 12(4):405—417, October 2004.
Bussieck, M.R., Lindner, T. and Lübbecke, M.
A fast algorithm for near cost optimal line plans. Mathematical Methods of Operations Research, 59(2):205–220, June 2004.
A fast algorithm for near cost optimal line plans. Mathematical Methods of Operations Research, 59(2):205–220, June 2004.
Fekete, S., Lübbecke, M. and Meijer, H.
Minimizing the stabbing number of matchings, trees, and triangulations. In Munro, I., SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 437—446, January 2004. Society for Industrial and Applied Mathematics.
Minimizing the stabbing number of matchings, trees, and triangulations. In Munro, I., SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 437—446, January 2004. Society for Industrial and Applied Mathematics.
Lübbecke, M. and Zimmermann, U.
Engine Routing and Scheduling at Industrial In-Plant Railroads. Transportation Science, 37(2):183—197, March 2003.
Engine Routing and Scheduling at Industrial In-Plant Railroads. Transportation Science, 37(2):183—197, March 2003.
Zimmermann, U. and Lübbecke, M.
Computer Aided Scheduling of Switching Engines. In Jäger, W. and Krebs, H., Mathematics — Key Technology for the Future. pages 690—702, Springer, January 2003.
Computer Aided Scheduling of Switching Engines. In Jäger, W. and Krebs, H., Mathematics — Key Technology for the Future. pages 690—702, Springer, January 2003.
Epping, T., Hochstättler, W. and Lübbecke, M.
MaxFlow-MinCut Duality for a Paint Shop Problem. In Leopold-Wildburger, U., Rendl, F. and Wäscher, G., Operations Research Proceedings 2002, pages 377—382, January 2003. Springer.
MaxFlow-MinCut Duality for a Paint Shop Problem. In Leopold-Wildburger, U., Rendl, F. and Wäscher, G., Operations Research Proceedings 2002, pages 377—382, January 2003. Springer.
Werners, B. and Lübbecke, M.
Tagungsbericht OR 2001 Gerhard-Mercator-Universität Duisburg. OR News, 13:35—37, November 2001.
Tagungsbericht OR 2001 Gerhard-Mercator-Universität Duisburg. OR News, 13:35—37, November 2001.
Lübbecke, M. and Zimmermann, U.
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen - Vom Bedarf zum Produkt. Arbeitskreis Mathematik in Forschung und Praxis, pages 35—40, January 2000. Symposium Modellierung und Simulation von Verkehr.
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen - Vom Bedarf zum Produkt. Arbeitskreis Mathematik in Forschung und Praxis, pages 35—40, January 2000. Symposium Modellierung und Simulation von Verkehr.
Bernatzki, K.-P., Bussieck, M.R., Lindner, T. and Lübbecke, M.
Optimal scrap combination for steel production. OR Spectrum, 20(4):251—258, October 1998.
Optimal scrap combination for steel production. OR Spectrum, 20(4):251—258, October 1998.
Bussieck, M.R. and Lübbecke, M.
The vertex set of a 0/1-polytope is strongly P-enumerable. Computational Geometry, 11(2):103—109, October 1998.
The vertex set of a 0/1-polytope is strongly P-enumerable. Computational Geometry, 11(2):103—109, October 1998.
Bussieck, M.R., Lübbecke, M., Winter, T. and Zimmermann, U.
Discrete optimization in rail transport. Proceedings of 11th Baikal International School-Seminar on Optimization Methods and their Applications, pages 225—234, May 1998.
Discrete optimization in rail transport. Proceedings of 11th Baikal International School-Seminar on Optimization Methods and their Applications, pages 225—234, May 1998.
Talks
Seminar Demokratie und Wissenschaft · Konrad-Adenauer-Stiftung,
Aachen,
Germany,
Apr 23, 2022.
Women in OR & Analytics Event (online),
Jan 19, 2022.
Gurobi Industry Days,
Köln (online),
Germany,
Nov 9, 2021.
RWTH WiWi Network · Research Talk,
Aachen (online),
Germany,
Sep 22, 2021.
invite:
Die Qual der Wahl: wieso wir in Entscheidungssituationen mehr Fantasie brauchen
von M. Lübbecke
Annual conference of the German Operations Research Society,
Bern (online),
Switzerland,
Sep 3, 2021.
title:
An Image-based Approach to Detecting Structural Similarity Among Mixed Integer Programs
von M. Lübbecke
Projekt Leonardo, RWTH,
Aachen (online),
Germany,
Jul 2, 2020.
NGB/LNMB Seminar "Back to school, learn about the latest developments in Operations Research",
Lunteren,
Netherlands,
January 16, 2019.
FORA Symposium,
Aachen,
Germany,
December 18, 2018.
SPOC18 "Machine Learning, Networks and Combinatorial Optimization",
Paris,
France,
December 14, 2018.
INFORMS Conference on Business Analytics & Operations Research,
Baltimore,
United States,
April 16, 2018.
participation
von M. Lübbecke
11th International Conference on the Practice and Theory of Automated Timetabling,
Udine,
Italy,
August 23-26, 2016.
plenary:
University Course Timetabling: from three-, to two-, to one-indexed formulations: what's next?
von M. Lübbecke
participation
von M. Lübbecke
title:
A Contraction-Expansion Algorithm for the Capacitated Minimum Cost Flow Problem
von M. Lübbecke
TRISTAN VIII: Triennial Symposium on Transporation Analysis,
San Pedro de Atacama,
Chile,
June 9-14, 2013.
Danish Operations Research Society: Applications of Optimization - Best Practice and Challenges,
Copenhagen,
Denmark,
May 29, 2013.
participation
von M. Lübbecke
Edinburgh Research Group in Optimization,
University of Edinburgh,
United Kingdom,
February 13, 2013.
SICS konferens om industriell effektivitet,
The Swedish Intitute of Computer Science, Stockholm,
Sweden,
February 11, 2013.
participation
von M. Lübbecke
3. Brazilian-German Frontiers of Science and Technology Symposium (BRAGFOST),
Brasilia,
Brazil,
November 8-11, 2012.
12th Conference of the IFIP Working Group 7.6 on Advanced Analytics,
Aachen,
Germany,
August 29-31, 2012.
title:
Solving integer programs by branch-and-price (automatically, since three weeks)
von M. Lübbecke
International Symposium on Mathematical Programming (ISMP) 2012,
Berlin,
Germany,
August 19-24, 2012.
Annual Meeting of SPP Algorithm Engineering 2012,
Frankfurt,
Germany,
July 2-4, 2012.
participation
von M. Lübbecke
11th International Symposium on Experimental Algorithms (SEA 2012),
Bordeaux,
France,
June 7-9, 2012.
Mathematisches Kolloquium,
Fachgruppe Mathematik, RWTH,
Germany,
November 29, 2011.
International Conference on Operations Research,
Zurich,
Switzerland,
August 30-September 2, 2011.
Mixed Integer Programming Workshop MIP2011,
U Waterloo,
Canada,
June 20-23, 2011.
15th Conference on Integer Programming and Combinatorial Optimization (IPCO),
Armonk, NY,
United States,
June 15-17, 2011.
participation
von M. Lübbecke
SIAM conference on optimization
SIAM Conference on Optimization,
Darmstadt,
Germany,
May 16-19, 2011.
participation
von M. Lübbecke
Kolloquium "Optimierung und Operations Research",
TU Dortmund,
Germany,
May 9, 2011.
Annual Meeting of SPP Algorithm Engineering 2011,
Berlin,
Germany,
May 2-4, 2011.
participation
von M. Lübbecke
INFORMS conference on business analytics and operations research,
Chicago,
United States,
April 10-12, 2011.
Symposium of the GOR working group "real world optimization",
Bad Honnef,
Germany,
April 7-8, 2011.
Københavns Universitet, DIKU,
København,
Denmark,
March 28, 2011.
Operations Research Seminar,
Maastricht University, Department of Quantitative Economics,
Belgium,
February 22, 2011.
15th Combinatorial Optimization Workshop,
Aussois,
France,
January 10-14, 2011.
DFG SPP Workshop on Algorithm Engineering in Optimization,
Cologne,
Germany,
December 3, 2010.
participation
von M. Lübbecke
Operations Research (OR),
Munich,
Germany,
September 1-3, 2010.
title:
Nested Column Generation for a Ship Routing and Scheduling Problem with Split Pickup and Split Delivery
von M. Lübbecke
ALGO,
Liverpool,
United Kingdom,
September 6-10, 2010.
participation
von M. Lübbecke
Seventh Triennial Symposium on Transportation Analysis (TRISTAN 7),
Tromsø,
Norway,
June 20-25, 2010.
title:
Nested Column Generation for a Ship Routing and Scheduling Problem with Split Pickup and Split Delivery
von M. Lübbecke
Annual Meeting of SPP Algorithm Engineering 2010,
Halle,
Germany,
June 16-18, 2010.
participation
von M. Lübbecke
9th International Symposium on Experimental Algorithms (SEA 2010),
Ischia Island (Napoli),
Italy,
May 20-22, 2010.
participation
von M. Lübbecke
MathInside - Mathematik ist überall,
Urania, Berlin,
Germany,
March 23, 2010.
seminar:
Wir haben den Kanal voll - Diskrete Optimierung hilft dem Schiffsverkehr im Nord-Ostsee-Kanal
von M. Lübbecke
DMV Jahrestagung,
Munich,
Germany,
March 8-12, 2010.
14th Combinatorial Optimization Workshop,
Aussois,
France,
January 3-9, 2010.
participation
von M. Lübbecke
Symposium of the GOR working group "real world optimization",
Bad Honnef,
Germany,
November 19-20, 2009.
20th International Symposium on Mathematical Programming,
Chicago,
United States,
August 23-28, 2009.
European Conference on Operational Research, EURO XXIII,
Bonn,
Germany,
July 5-8, 2009.
Models and Algorithms for Optimization in Logistics,
Dagstuhl,
Germany,
June 21-26, 2009.
participation
von M. Lübbecke
DFG SPP Workshop Algorithm Engineering for Integer Programming,
Kiel,
Germany,
May 7-8, 2009.
13th Combinatorial Optimization Workshop,
Aussois,
France,
January 11-17, 2009.
International Symposium on Algorithms and Computation (ISAAC),
Gold Coast,
Australia,
December 15-17, 2008.
participation
von M. Lübbecke
European Symposium on Algorithms (ESA),
Karlsruhe,
Germany,
September 15-17, 2008.
participation
von M. Lübbecke
Operations Research (OR),
Augsburg,
Germany,
September 2-5, 2008.
Oberseminar Effizienz dezentraler Strukturen, Lehrstuhl für Wirtschaftsmathematik, Universität Bayreuth,
Bayreuth,
Germany,
July 7, 2008.
Column Generation 2008,
Aussois,
France,
June 17-20, 2008.
participation
von M. Lübbecke
Workshop on Experimental Algorithms (WEA),
Provincetown, MA,
United States,
May 30 - June 1, 2008.
Vortragsreihe Operations Research,
Universität Karlsruhe (TH),
Germany,
May 16, 2008.
Mathematisches Kolloquium, Technische Universität Dortmund,
Dortmund,
Germany,
May 6, 2008.
invite:
Ganzzahlige Programme in diskreter Optimierung und industriellen Anwendungen
von M. Lübbecke
Mathematisches Kolloquium, Technische Universität Clausthal,
Clausthal,
Germany,
February 22, 2008.
invite:
Ganzzahlige Programme in diskreter Optimierung und industriellen Anwendungen
von M. Lübbecke
5th Workshop on Approximation and Online Algorithms (WAOA),
Eilat,
Israel,
October 11-12, 2007.
participation
von M. Lübbecke
15th Annual European Symposium on Algorithms (ESA),
Eilat,
Israel,
October 8-10, 2007.
participation
von M. Lübbecke
Operations Research 2007,
Saarbrücken,
Germany,
September 4-7, 2007.
Festkolloquium 60th anniversary of Uwe Zimmermann,
TU Braunschweig,
Germany,
April 27, 2007.
Colloquium of the Research Training Group "Methods for Discrete Structures",
FU Berlin,
Germany,
January 29, 2007.
Kolloquium "Optimierung und Operations Research",
Universität Dortmund,
Germany,
January 25, 2007.
11th Combinatorial Optimization Workshop,
Aussois,
France,
January 7-12, 2007.
Symposium Metallindustrie und Mathematik,
Bad Honnef,
Germany,
November 2-3, 2006.
participation
von M. Lübbecke
ARRIVAL/Matheon Fall School 2006 on Timetabling and Line Planning,
Dabendorf near Berlin,
Germany,
September 26-29, 2006.
Operations Research 2006,
Karlsruhe,
Germany,
September 6-8, 2006.
participation
von M. Lübbecke
GERAD Summer school on column generation,
Montréal,
Canada,
May 15-19, 2006.
ARRIVAL Kick-off meeting,
Patras,
Greece,
March 30-31, 2006.
participation
von M. Lübbecke
Seminar, Centre for Traffic and Transport, Technical University of Denmark,
Copenhagen,
Denmark,
March 24, 2006.
invite:
Towards Industrial Railroad Optimization: Switching, Routing, and Scheduling
von M. Lübbecke
High Performance Scientific Computing,
Hanoi,
Vietnam,
March 6-10, 2006.
participation
von M. Lübbecke
10th Combinatorial Optimization Workshop,
Aussois,
France,
January 8-13, 2006.
invite:
von M. Lübbecke
Combinatorial Optimization,
Oberwolfach,
Germany,
November 6-12, 2005.
invite:
Towards Industrial Railroad Optimization: Switching, Routing, and Scheduling
von M. Lübbecke
IMA "Hot Topics" Workshop: Mixed-Integer Programming,
Minneapolis,
United States,
July 25-29, 2005.
participation
von M. Lübbecke
XI. IPCO,
Berlin,
Germany,
June 8-10, 2005.
participation
von M. Lübbecke
4th International Workshop on Efficient and Experimental Algorithms (WEA 05),
Santorini Island,
Greece,
May 10-13, 2005.
participation
von M. Lübbecke
9th Combinatorial Optimization Workshop,
Aussois,
France,
March 13-19, 2005.
invite:
von M. Lübbecke
Algorithms for Optimization with Incomplete Information,
Dagstuhl,
Germany,
January 16-21, 2005.
invite:
von M. Lübbecke
Oberseminar über Diskrete Optimierung, Universität Dortmund,
Dortmund,
Germany,
November 18, 2004.
Kolloquium "Optimierung und Operations Research",
Universität Dortmund,
Germany,
November 17, 2004.
seminar:
Einschränken der Ladebedingungen beim Pickup and Delivery Problem: Gut für Theorie und Praxis
von M. Lübbecke
Operations Research 2004,
Tilburg,
Netherlands,
September 1-3, 2004.
Berliner Algorithmen Tag 2004,
TU Berlin,
Germany,
July 12, 2004.
participation
von M. Lübbecke
Colloquium within the European Graduate Program "Combinatorics, Geometry and Computation",
FU Berlin,
Germany,
April 19, 2004.
SIGOPT, International Conference on Optimization,
Wittenberg,
Germany,
February 15-18, 2004.
15th ACM-SIAM Symposium on Discrete Algorithms (SODA04),
New Orleans, LA,
United States,
January 11-13, 2004.
8th Combinatorial Optimization Workshop,
Aussois,
France,
January 4-9, 2004.
Netzwerktag, DFG-Forschungszentrum Mathematik für Schlüsseltechnologien,
TU Berlin,
Germany,
December 15, 2003.
participation
von M. Lübbecke
GOR Workshop "Optimierung im Öffentlichen Nahverkehr",
ZIB, Berlin,
Germany,
November 13-14, 2003.
18th International Symposium on Mathematical Programming,
Copenhagen,
Denmark,
August 18-22, 2003.
BMBF-Workshop Verkehr, Transport, Logistik, Energiewirtschaft,
Lahmeyer International, Bad Vilbel,
Germany,
June 26-27, 2003.
ROUTE 2003, International Workshop on Vehicle Routing,
Skodsborg,
Denmark,
June 22-25, 2003.
19th European Workshop of Computational Geometry,
Bonn,
Germany,
March 24-26, 2003.
participation
von M. Lübbecke
7th Combinatorial Optimization Workshop,
Aussois,
France,
March 9-15, 2003.
Combinatorial Optimization,
Oberwolfach,
Germany,
November 24-30, 2002.
3rd Research Seminar on Railway Optimization Problems,
Oegstgeest,
Netherlands,
October 1-4, 2002.
OR 2002, International Conference on Operations Research,
Klagenfurt,
Austria,
September 2-5, 2002.
Tag der Mathematik und Informatik,
Braunschweig,
Germany,
September 25, 2002.
OR2002, International Conference on Operations Research,
Klagenfurt,
Austria,
September 2-5, 2002.
Forum "Mathematik in der BASF",
Ludwigshafen,
Germany,
June 27, 2002.
participation
von M. Lübbecke
Algorithms Seminar, School of Computer Science, McGill University,
Montréal,
Canada,
June 3, 2002.
GERAD Seminar, Group for Research in Decision Analysis,
Montréal,
Canada,
May 31, 2002.
IPCO2002, Ninth Conference on Integer Programming and Combinatorial Optimization,
MIT, Cambridge, MA,
United States,
May 27-29, 2002.
participation
von M. Lübbecke
Second Summer School on Integer Programming and Combinatorial Optimization,
MIT, Cambridge, MA,
United States,
May 25-26, 2002.
participation
von M. Lübbecke
Seminar, Department of Applied Mathematics and Statistics,
University at Stony Brook, NY,
United States,
May 20, 2002.
Combinatorial Optimization Seminar, Department of Combinatorics and Optimization, University of Waterloo,
Ontario,
Canada,
May 16, 2002.
Seminar, Department of Computing and Information Science, Queen's University,
Kingston, Ontario,
Canada,
May 14, 2002.
BMBF-Workshop Verkehr, Transport, Logistik, Energiewirtschaft,
DB Systems, Frankfurt,
Germany,
February 28-March 1, 2002.
Mathematical Methods in Manufacturing and Logistics,
Oberwolfach,
Germany,
December 16-21, 2001.
Mathematisches Kolloquium,
Brandenburgische Technische Universität Cottbus,
Germany,
November 13, 2001.
OR2001, Symposium on Operations Research,
Duisburg,
Germany,
September 3-5, 2001.
BMBF-Workshop Verkehr, Transport, Logistik / Energietechnik und -wirtschaft,
Technische Universität Berlin,
Germany,
April 5-6, 2001.
5th Combinatorial Optimization Workshop,
Aussois,
France,
March 5-9, 2001.
Status seminar of the BMBF research program New Mathematical Methods in Industry and Service,
Frankfurt/Main,
Germany,
December 11-12, 2000.
participation
von M. Lübbecke
AMORE Research Seminar on Railway Optimization Problems,
Konstanz,
Germany,
October 16-20, 2000.
OR2000, International Conference on Operations Research,
Dresden,
Germany,
September 9-12, 2000.
ROUTE2000, International Workshop on Vehicle Routing,
Skodsborg,
Denmark,
August 16-19, 2000.
ISMP2000, 17th International Symposium on Mathematical Programming,
Atlanta, GA,
United States,
August 7-11, 2000.
CASPT-2000, 8th International Conference "Computer-Aided Scheduling of Public Transport",
Berlin,
Germany,
June 21-23, 2000.
Modellierung und Simulation von Verkehr, Arbeitskreis Mathematik in Forschung und Praxis,
Physikzentrum Bad Honnef,
Germany,
November 18-19, 1999.
invite:
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen: Vom Bedarf zum Produkt
von M. Lübbecke
Mathematisches Kolloquium 1999, Forschungsseminar "Diskrete Mathematik und Optimierung",
Gerhard-Mercator-Universität Duisburg,
Germany,
November 17, 1999.
seminar:
Optimale Disposition von Rangierlokomotiven bei Werks- und Industriebahnen: Vom Bedarf zum Produkt
von M. Lübbecke
1. BMBF Workshop Diskrete Optimierung, Verkehr und Einsatzplanung,
Konrad-Zuse-Zentrum Berlin,
Germany,
November 9, 1998.
Traffic and Transport Optimization,
Oberwolfach,
Germany,
November 7-13, 1999.
Bonn Workshop on Discrete Optimization,
Bonn,
Germany,
September 28-October 2, 1998.
Symposium on Operations Research 1999,
Magdeburg,
Germany,
September 1-3, 1999.
DIMACS Workshop on the Theory and Practice of Integer Programming in honor of Ralph E. Gomory on the Occasion of his 70th Birthday,
IBM Watson Research Center, Yorktown Heights, NY,
United States,
August 2-4, 1999.
participation
von M. Lübbecke
DO99, Workshop on Discrete Optimization,
Rutgers University, NJ,
United States,
July 25-30, 1999.
MAPSP99, Fourth Workshop on Models and Algorithms for Planning and Scheduling Problems,
Renesse,
Netherlands,
June 14-18, 1999.
Status seminar of the BMBF research program Mathematical Methods for Solving Problems in Industry and Business,
Erlangen,
Germany,
February 17-19, 1999.
participation
von M. Lübbecke
International Conference on Operations Research 1998,
Zurich,
Switzerland,
August 31-September 3, 1998.
title:
Computational Study of an Engine Scheduling Problem at Industrial Freight Railroad Companies
von M. Lübbecke
Colloquium on Intermodal Transport,
Braunschweig University of Technology,
Germany,
July 15, 1998.
participation
von M. Lübbecke
29. Session of GOR working group on logistics,
Hildesheim,
Germany,
July 2-3, 1998.
participation
von M. Lübbecke
Combinatorial and Global Optimization,
Chania, Crete,
Greece,
May 25-29, 1998.
title:
Mixed Integer Formulation of a Locomotive Scheduling Problem at Industrial Freight Railroads
von M. Lübbecke
Workshop on Computational Integer Programming,
ZIB Berlin,
Germany,
November 16-18, 1997.
participation
von M. Lübbecke
Status seminar of the BMBF research program Mathematical Methods for Solving Problems in Industry and Business,
Heidelberg,
Germany,
October 29-31, 1997.
participation
von M. Lübbecke
Symposium on Operations Research 1997,
Jena,
Germany,
September 3-5, 1997.
ISMP 97 - XVI. International Symposium on Mathematical Programming,
EPFL, Lausanne,
Switzerland,
August 24-29, 1997.
Workshop Preparing the Future,
EXPO2000 GmbH, Hanover,
Germany,
July 7, 1997.
participation
von M. Lübbecke
Mediengestützte wissenschaftliche Weiterbildung,
Braunschweig,
Germany,
March 20-21, 1997.
participation
von M. Lübbecke
Duisburger Kongress Mathematik in Industrie und Wirtschaft,
Duisburg,
Germany,
March 10-13, 1997.
participation
von M. Lübbecke
Third Joint IuK Workshop Multimedia in den Wissenschaften,
Würzburg,
Germany,
March 3-5, 1997.
participation
von M. Lübbecke
Workshop Metadaten und Strukturierung elektronischer Information,
SUB Göttingen,
Germany,
December 15-17, 1996.
participation
von M. Lübbecke
Summer School Discrete Optimization,
Hamburg Harburg,
Germany,
September 9-13, 1996.
participation
von M. Lübbecke
Symposium on Operations Research 1996,
Braunschweig,
Germany,
September 3-6, 1996.
participation
von M. Lübbecke
RepORts
Desrosiers, J., Lübbecke, M., Desaulniers, G. and Gauthier, J.-B.
Branch-and-Price. repORt 2024—67, July 2024. Cahiers de GERAD, G-2024-36.
Branch-and-Price. repORt 2024—67, July 2024. Cahiers de GERAD, G-2024-36.
Mühmer, E., Ganz, M., Lübbecke, M. and Willamowski, F.J.L.
The Multi-Stop Station Location Problem: Exact Approaches. repORt 2023—65, December 2023.
The Multi-Stop Station Location Problem: Exact Approaches. repORt 2023—65, December 2023.
Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A.M., Gottwald, L., Graczyk, Chr., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S.J., Matter, F., Mühmer, E., Müller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, St., Schlösser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, Ph., Weninger, D. and Witzig, J.
Enabling Research through the SCIP Optimization Suite 8.0. repORt 2022—65, April 2022.
Enabling Research through the SCIP Optimization Suite 8.0. repORt 2022—65, April 2022.
Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A.M., Gottwald, L., Graczyk, Chr., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S.J., Matter, F., Mühmer, E., Müller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, St., Schlösser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, Ph., Weninger, D. and Witzig, J.
The SCIP Optimization Suite 8.0. repORt 2022—64, April 2022.
The SCIP Optimization Suite 8.0. repORt 2022—64, April 2022.
Steever, Zachary, Murray, Chase, Yuan, Junsong, Karwan, Mark and Lübbecke, M.
An Image-based Approach to Detecting Structural Similarity Among Mixed Integer Programs. repORt 2020—59, April 2020.
An Image-based Approach to Detecting Structural Similarity Among Mixed Integer Programs. repORt 2020—59, April 2020.
Gleixner, A.M., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J.T., Lübbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D. and Shinano, Y.
MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library. repORt 2019—55, July 2019. Submitted..
MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library. repORt 2019—55, July 2019. Submitted..
Lübbecke, M., Puchert, C., Schiewe, Ph. and Schöbel, A.
Integrating line planning, timetabling, and vehicle scheduling: Integer programming formulation and analysis. repORt 2019—54, February 2019.
Integrating line planning, timetabling, and vehicle scheduling: Integer programming formulation and analysis. repORt 2019—54, February 2019.
Lübbecke, M., Maher, S.J. and Witt, J.T.
Avoiding redundant columns by adding classical Benders cuts to column generation. repORt 2019—53, February 2019.
Avoiding redundant columns by adding classical Benders cuts to column generation. repORt 2019—53, February 2019.
Goderbauer, S., Wicke, G. and Lübbecke, M.
Neueinteilung der Bundestagswahlkreise mithilfe mathematischer Optimierung — Szenario: 125 Bundestagswahlkreise. repORt 2018—051, October 2018. Studie für und im Auftrag des Bundeswahlleiters.
Neueinteilung der Bundestagswahlkreise mithilfe mathematischer Optimierung — Szenario: 125 Bundestagswahlkreise. repORt 2018—051, October 2018. Studie für und im Auftrag des Bundeswahlleiters.
Goderbauer, S., Wicke, G. and Lübbecke, M.
Neueinteilung der Bundestagswahlkreise mithilfe mathematischer Optimierung — Szenarien: 250 und 200 Bundestagswahlkreise. repORt 2018—050, September 2018. Studie für und im Auftrag des Bundeswahlleiters.
Neueinteilung der Bundestagswahlkreise mithilfe mathematischer Optimierung — Szenarien: 250 und 200 Bundestagswahlkreise. repORt 2018—050, September 2018. Studie für und im Auftrag des Bundeswahlleiters.
Gleixner, A.M., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Lübbecke, M., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schlösser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T. and Witzig, J.
The SCIP Optimization Suite 6.0. repORt 2018—049, July 2018.
The SCIP Optimization Suite 6.0. repORt 2018—049, July 2018.
Bastubbe, M., Lübbecke, M. and Witt, J.T.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. repORt 2018—047, February 2018. Published.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. repORt 2018—047, February 2018. Published.
Bastubbe, M. and Lübbecke, M.
A Branch-and-Price Algorithm for Capacitated Hypergraph Vertex Separation. repORt 2017—040, November 2017.
A Branch-and-Price Algorithm for Capacitated Hypergraph Vertex Separation. repORt 2017—040, November 2017.
Witt, J.T., Lübbecke, M. and Reed, B.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. repORt 2017—039, April 2017. Published.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. repORt 2017—039, April 2017. Published.
Brinker, J., Lübbecke, M. and Takeda, Y.
Optimization of the Reconfiguration Planning of Handling Systems based on Parallel Manipulators with Delta-Like Architecture. repORt 2017—038, February 2017.
Optimization of the Reconfiguration Planning of Handling Systems based on Parallel Manipulators with Delta-Like Architecture. repORt 2017—038, February 2017.
Lübbecke, M. and Parmentier, A.
Learning when to use a decomposition. repORt 2016—037, November 2016.
Learning when to use a decomposition. repORt 2016—037, November 2016.
Goderbauer, S., Bahl, B., Voll, P., Lübbecke, M., Bardow, A. and Koster, A.M.C.A.
An Adaptive Discretization MINLP Algorithm for Optimal Synthesis of Decentralized Energy Supply Systems. repORt 2016—033, June 2016. Published in Computers & Chemical Engineering 95:38-48, 2016.
An Adaptive Discretization MINLP Algorithm for Optimal Synthesis of Decentralized Energy Supply Systems. repORt 2016—033, June 2016. Published in Computers & Chemical Engineering 95:38-48, 2016.
Bahl, B., Goderbauer, S., Arnold, F., Voll, P., Lübbecke, M., Bardow, A. and Koster, A.M.C.A.
DESSLib - Benchmark Instances for Optimization of Decentralized Energy Supply Systems. repORt 2016—035, June 2016. http://www.math2.rwth-aachen.de/DESSLib/.
DESSLib - Benchmark Instances for Optimization of Decentralized Energy Supply Systems. repORt 2016—035, June 2016. http://www.math2.rwth-aachen.de/DESSLib/.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
A strongly polynomial contraction-expansion algorithm for network flow problems. repORt 2016—032, March 2016.
A strongly polynomial contraction-expansion algorithm for network flow problems. repORt 2016—032, March 2016.
Lübbecke, M. and Witt, J.T.
Dantzig-Wolfe Reformulations for the Stable Set Problem. repORt 2015—029, November 2015.
Dantzig-Wolfe Reformulations for the Stable Set Problem. repORt 2015—029, November 2015.
Lübbecke, M. and Puchert, C.
Primal Heuristics for Mixed Integer Programs with a Staircase Structure. repORt 2015—026, February 2015.
Primal Heuristics for Mixed Integer Programs with a Staircase Structure. repORt 2015—026, February 2015.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Vector Space Decomposition for Solving Large-Scale Linear Programs. repORt 2015—025, February 2015.
Vector Space Decomposition for Solving Large-Scale Linear Programs. repORt 2015—025, February 2015.
Witt, J.T. and Lübbecke, M.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. repORt 2015—024, February 2015. Published.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. repORt 2015—024, February 2015. Published.
Lübbecke, M.
Comments on: An Overview of Curriculum-Based Course Timetabling. repORt 2015—023, January 2015.
Comments on: An Overview of Curriculum-Based Course Timetabling. repORt 2015—023, January 2015.
Lübbecke, M. and Möhring, R.
Ship Traffic Optimization for the Kiel Canal. repORt 2014—022, November 2014.
Ship Traffic Optimization for the Kiel Canal. repORt 2014—022, November 2014.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Decomposition theorems for linear programs. repORt 2014—020, September 2014.
Decomposition theorems for linear programs. repORt 2014—020, September 2014.
Kirchner, S. and Lübbecke, M.
Dynamische Vergabe von Patiententerminen in Krankenhäusern. repORt 2014—019, February 2014.
Dynamische Vergabe von Patiententerminen in Krankenhäusern. repORt 2014—019, February 2014.
Bergner, M., Caprara, A., Ceselli, A., Furini, F. and Lübbecke, M.
Automatic {D}antzig-{W}olfe Reformulation of Mixed Integer Programs. repORt 2013—017, November 2013.
Automatic {D}antzig-{W}olfe Reformulation of Mixed Integer Programs. repORt 2013—017, November 2013.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
Tools for primal degenerate linear programs: IPS, DCA, and PE. repORt 2013—016, October 2013.
Tools for primal degenerate linear programs: IPS, DCA, and PE. repORt 2013—016, October 2013.
Gauthier, J.-B., Desrosiers, J. and Lübbecke, M.
About the minimum mean cycle-canceling algorithm. repORt 2013—015, September 2013.
About the minimum mean cycle-canceling algorithm. repORt 2013—015, September 2013.
Coughlan, E.T., Lübbecke, M. and Schulz, J.
A Branch-Price-and-Cut Algorithm for Multi-Mode Resource Leveling. repORt 2013—014, September 2013.
A Branch-Price-and-Cut Algorithm for Multi-Mode Resource Leveling. repORt 2013—014, September 2013.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. repORt 2013—011, April 2013. Published.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. repORt 2013—011, April 2013. Published.
Desrosiers, J., Gauthier, J.-B. and Lübbecke, M.
Row-Reduced Column Generation for Degenerate Master Problems. repORt 2013—008, February 2013.
Row-Reduced Column Generation for Degenerate Master Problems. repORt 2013—008, February 2013.
Lübbecke, M.
Generic Decomposition and Branch-and-Price: A Status Report. repORt 2012—005, April 2012.
Generic Decomposition and Branch-and-Price: A Status Report. repORt 2012—005, April 2012.
Hennig, F., Nygreen, B. and Lübbecke, M.
Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. repORt 2012—004, March 2012.
Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. repORt 2012—004, March 2012.
Lübbecke, M. and Puchert, C.
Primal Heuristics for Branch-and-Price Algorithms. repORt 2011—003, November 2011.
Primal Heuristics for Branch-and-Price Algorithms. repORt 2011—003, November 2011.
Bergner, M., Caprara, A., Furini, F., Lübbecke, M., Malaguti, E. and Traversi, E.
Partial convexification of general {MIP}s by {D}antzig-{W}olfe reformulation. repORt 2010—001, November 2010.
Partial convexification of general {MIP}s by {D}antzig-{W}olfe reformulation. repORt 2010—001, November 2010.