The vertex set of a 0/1-polytope is strongly P-enumerable. - Michael R. Bussieck; Marco E. Lübbecke (Comput. Geom., 1998)

MaxFlow-MinCut Duality for a Paint Shop Problem. - Thomas Epping; Winfried Hochstättler; Marco E. Lübbecke (OR, 2002)

Engine Routing and Scheduling at Industrial In-Plant Railroads. - Marco E. Lübbecke; Uwe T. Zimmermann (Transp. Sci., 2003)

A fast algorithm for near cost optimal line plans. - Michael R. Bussieck; Thomas Lindner; Marco E. Lübbecke (Math. Methods Oper. Res., 2004)

On Compact Formulations for Integer Programs Solved by Column Generation. - Daniel Villeneuve; Jacques Desrosiers; Marco E. Lübbecke; François Soumis (Ann. Oper. Res., 2005)

Shunting Minimal Rail Car Allocation. - Marco E. Lübbecke; Uwe T. Zimmermann (Comput. Optim. Appl., 2005)

Dual variable based fathoming in dynamic programs for column generation. - Marco E. Lübbecke (Eur. J. Oper. Res., 2005)

Selected Topics in Column Generation. - Marco E. Lübbecke; Jacques Desrosiers (Oper. Res., 2005)

On Minimum k-Modal Partitions of Permutations. - Gabriele Di Stefano; Stefan Krause; Marco E. Lübbecke; Uwe T. Zimmermann (LATIN, 2006)

Rectangle covers revisited computationally. - Laura Heinrich-Litan; Marco E. Lübbecke (ACM J. Exp. Algorithmics, 2006)

Solutions to Real-World Instances of PSPACE-Complete Stacking. - Felix G. König; Marco E. Lübbecke; Rolf H. Möhring; Guido Schäfer; Ines Spenke (ESA, 2007)

Editorial. - Stefan Felsner; Marco E. Lübbecke; Jarik Nesetril (Eur. J. Comb., 2007)

Sorting with Complete Networks of Stacks. - Felix G. König; Marco E. Lübbecke (ISAAC, 2008)

Optimal University Course Timetables and the Partial Transversal Polytope. - Gerald Lach; Marco E. Lübbecke (WEA, 2008)

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. - Sándor P. Fekete; Marco E. Lübbecke; Henk Meijer (Discret. Comput. Geom., 2008)

Preface. - Stefan Felsner; Marco E. Lübbecke; Jarik Nesetril (Discret. Math., 2008)

On minimum k-modal partitions of permutations. - Gabriele Di Stefano; Stefan Krause; Marco E. Lübbecke; Uwe T. Zimmermann (J. Discrete Algorithms, 2008)

Optimizing the Cargo Express Service of Swiss Federal Railways. - Alberto Ceselli; Michael Gatto; Marco E. Lübbecke; Marc Nunkesser; Heiko Schilling (Transp. Sci., 2008)

Sequencing and Scheduling in Coil Coating with Shuttles. - Wiebke Höhn; Felix G. König; Marco E. Lübbecke; Rolf H. Möhring (Models and Algorithms for Optimization in Logistics, 2009)

The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. - Christian Liebchen; Marco E. Lübbecke; Rolf H. Möhring; Sebastian Stiller (Robust and Online Large-Scale Optimization, 2009)

Frontmatter, Table of Contents, Preface, Organization. - Thomas Erlebach; Marco E. Lübbecke (ATMOS, 2010)

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. - Timo Berthold; Stefan Heinz 001; Marco E. Lübbecke; Rolf H. Möhring; Jens Schulz (CPAIOR, 2010)

A Branch-and-Price Algorithm for Multi-mode Resource Leveling. - Eamonn T. Coughlan; Marco E. Lübbecke; Jens Schulz (SEA, 2010)

Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. - Gerald Gamrath; Marco E. Lübbecke (SEA, 2010)

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. - Martin Bergner; Alberto Caprara; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (IPCO, 2011)

Primal Heuristics for Branch-and-Price Algorithms. - Marco E. Lübbecke; Christian Puchert (OR, 2011)

Integrated Sequencing and Scheduling in Coil Coating. - Wiebke Höhn; Felix G. König; Rolf H. Möhring; Marco E. Lübbecke (Manag. Sci., 2011)

Automatic Decomposition and Branch-and-Price - A Status Report. - Marco E. Lübbecke (SEA, 2012)

Curriculum based course timetabling: new solutions to Udine benchmark instances. - Gerald Lach; Marco E. Lübbecke (Ann. Oper. Res., 2012)

Row-reduced column generation for degenerate master problems. - Jacques Desrosiers; Jean Bertrand Gauthier; Marco E. Lübbecke (Eur. J. Oper. Res., 2014)

Decomposition theorems for linear programs. - Jean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke (Oper. Res. Lett., 2014)

Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. - Marco E. Lübbecke; Jonas T. Witt (SEA, 2015)

About the minimum mean cycle-canceling algorithm. - Jean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke (Discret. Appl. Math., 2015)

A branch-price-and-cut algorithm for multi-mode resource leveling. - Eamonn T. Coughlan; Marco E. Lübbecke; Jens Schulz (Eur. J. Oper. Res., 2015)

Automatic Dantzig-Wolfe reformulation of mixed integer programs. - Martin Bergner; Alberto Caprara; Alberto Ceselli; Fabio Furini; Marco E. Lübbecke; Enrico Malaguti; Emiliano Traversi (Math. Program., 2015)

An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. - Sebastian Goderbauer; Björn Bahl; Philip Voll; Marco E. Lübbecke; André Bardow; Arie M. C. A. Koster (Comput. Chem. Eng., 2016)

Tools for primal degenerate linear programs: IPS, DCA, and PE. - Jean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke (EURO J. Transp. Logist., 2016)

A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. - Martin Bergner; Marco E. Lübbecke; Jonas T. Witt (ACM J. Exp. Algorithmics, 2016)

Learning When to Use a Decomposition. - Markus Kruber; Marco E. Lübbecke; Axel Parmentier (CPAIOR, 2017)

A strongly polynomial Contraction-Expansion algorithm for network flow problems. - Jean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke (Comput. Oper. Res., 2017)

Optimization of the Reconfiguration Planning of Handling Systems Based on Parallel Manipulators With Delta-Like Architecture. - Jan Brinker; Marco E. Lübbecke; Yukio Takeda; Burkhard Corves (IEEE Robotics Autom. Lett., 2017)

A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. - Michael Bastubbe; Marco E. Lübbecke; Jonas T. Witt (SEA, 2018)

The strength of Dantzig-Wolfe reformulations for the stable set and related problems. - Marco E. Lübbecke; Jonas T. Witt (Discret. Optim., 2018)

Vector Space Decomposition for Solving Large-Scale Linear Programs. - Jean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke (Oper. Res., 2018)

Polyhedral results on the stable set problem in graphs containing even or odd pairs. - Jonas T. Witt; Marco E. Lübbecke; Bruce A. Reed (Math. Program., 2018)

Ship Traffic Optimization for the Kiel Canal. - Elisabeth Lübbecke; Marco E. Lübbecke; Rolf H. Möhring (Oper. Res., 2019)

A branch-and-price algorithm for capacitated hypergraph vertex separation. - Michael Bastubbe; Marco E. Lübbecke (Math. Program. Comput., 2020)

Welcome to SN Operations Research Forum! - Marco E. Lübbecke; Panos M. Pardalos (Oper. Res. Forum, 2020)

Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. - Marco E. Lübbecke; Stephen J. Maher; Jonas T. Witt (Discret. Optim., 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs. - Zachary Steever; Chase C. Murray; Junsong Yuan 001; Mark H. Karwan; Marco E. Lübbecke (INFORMS J. Comput., 2022)

Enabling Research through the SCIP Optimization Suite 8.0. - Ksenia Bestuzheva; Mathieu Besançon; Weikun Chen; Antonia Chmiela; Tim Donkiewicz; Jasper van Doornmalen; Leon Eifler; Oliver Gaul; Gerald Gamrath; Ambros M. Gleixner; Leona Gottwald; Christoph Graczyk; et al. (ACM Trans. Math. Softw., 2023)