Marco E. Lübbecke

According to our database1, Marco E. Lübbecke authored at least 46 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Ship Traffic Optimization for the Kiel Canal.
Operations Research, 2019

2018
Polyhedral results on the stable set problem in graphs containing even or odd pairs.
Math. Program., 2018

Vector Space Decomposition for Solving Large-Scale Linear Programs.
Operations Research, 2018

The strength of Dantzig-Wolfe reformulations for the stable set and related problems.
Discret. Optim., 2018

A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017
Optimization of the Reconfiguration Planning of Handling Systems Based on Parallel Manipulators With Delta-Like Architecture.
IEEE Robotics and Automation Letters, 2017

A strongly polynomial Contraction-Expansion algorithm for network flow problems.
Comput. Oper. Res., 2017

Learning When to Use a Decomposition.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.
ACM Journal of Experimental Algorithmics, 2016

Tools for primal degenerate linear programs: IPS, DCA, and PE.
EURO J. Transportation and Logistics, 2016

An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems.
Computers & Chemical Engineering, 2016

2015
Automatic Dantzig-Wolfe reformulation of mixed integer programs.
Math. Program., 2015

A branch-price-and-cut algorithm for multi-mode resource leveling.
Eur. J. Oper. Res., 2015

About the minimum mean cycle-canceling algorithm.
Discret. Appl. Math., 2015

Separation of Generic Cutting Planes in Branch-and-Price Using a Basis.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
Decomposition theorems for linear programs.
Oper. Res. Lett., 2014

Row-reduced column generation for degenerate master problems.
Eur. J. Oper. Res., 2014

2012
Curriculum based course timetabling: new solutions to Udine benchmark instances.
Annals OR, 2012

Automatic Decomposition and Branch-and-Price - A Status Report.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Integrated Sequencing and Scheduling in Coil Coating.
Management Science, 2011

Primal Heuristics for Branch-and-Price Algorithms.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

A Branch-and-Price Algorithm for Multi-mode Resource Leveling.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Frontmatter, Table of Contents, Preface, Organization.
Proceedings of the ATMOS 2010, 2010

2009
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Sequencing and Scheduling in Coil Coating with Shuttles.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008
Optimizing the Cargo Express Service of Swiss Federal Railways.
Transportation Science, 2008

On minimum k-modal partitions of permutations.
J. Discrete Algorithms, 2008

Preface.
Discret. Math., 2008

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.
Discrete & Computational Geometry, 2008

Optimal University Course Timetables and the Partial Transversal Polytope.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Sorting with Complete Networks of Stacks.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Editorial.
Eur. J. Comb., 2007

Solutions to Real-World Instances of PSPACE-Complete Stacking.
Proceedings of the Algorithms, 2007

2006
Rectangle covers revisited computationally.
ACM Journal of Experimental Algorithmics, 2006

On Minimum k-Modal Partitions of Permutations.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Selected Topics in Column Generation.
Operations Research, 2005

Dual variable based fathoming in dynamic programs for column generation.
Eur. J. Oper. Res., 2005

Shunting Minimal Rail Car Allocation.
Comp. Opt. and Appl., 2005

On Compact Formulations for Integer Programs Solved by Column Generation.
Annals OR, 2005

2004
A fast algorithm for near cost optimal line plans.
Math. Meth. of OR, 2004

2003
Engine Routing and Scheduling at Industrial In-Plant Railroads.
Transportation Science, 2003

2002
MaxFlow-MinCut Duality for a Paint Shop Problem.
Proceedings of the Operations Research Proceedings 2002, 2002

1998
The vertex set of a 0/1-polytope is strongly P-enumerable.
Comput. Geom., 1998


  Loading...