default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco E. Lübbecke
Person information
- affiliation: RWTH Aachen University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j35]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, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023)- 2022
- [j34]Zachary Steever, Chase C. Murray, Junsong Yuan, Mark H. Karwan, Marco E. Lübbecke:
An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs. INFORMS J. Comput. 34(4): 1849-1870 (2022) - 2021
- [j33]Marco E. Lübbecke, Stephen J. Maher, Jonas T. Witt:
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. Discret. Optim. 39: 100626 (2021) - [j32]Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - 2020
- [j31]Michael Bastubbe, Marco E. Lübbecke:
A branch-and-price algorithm for capacitated hypergraph vertex separation. Math. Program. Comput. 12(1): 39-68 (2020) - [j30]Marco E. Lübbecke, Panos M. Pardalos:
Welcome to SN Operations Research Forum! Oper. Res. Forum 1(1) (2020)
2010 – 2019
- 2019
- [j29]Elisabeth Lübbecke, Marco E. Lübbecke, Rolf H. Möhring:
Ship Traffic Optimization for the Kiel Canal. Oper. Res. 67(3): 791-812 (2019) - 2018
- [j28]Marco E. Lübbecke, Jonas T. Witt:
The strength of Dantzig-Wolfe reformulations for the stable set and related problems. Discret. Optim. 30: 168-187 (2018) - [j27]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Vector Space Decomposition for Solving Large-Scale Linear Programs. Oper. Res. 66(5): 1376-1389 (2018) - [j26]Jonas T. Witt, Marco E. Lübbecke, Bruce A. Reed:
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Math. Program. 171(1-2): 519-522 (2018) - [c18]Michael Bastubbe, Marco E. Lübbecke, Jonas T. Witt:
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. SEA 2018: 11:1-11:12 - 2017
- [j25]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
A strongly polynomial Contraction-Expansion algorithm for network flow problems. Comput. Oper. Res. 84: 16-32 (2017) - [j24]Jan Brinker, Marco E. Lübbecke, Yukio Takeda, Burkhard Corves:
Optimization of the Reconfiguration Planning of Handling Systems Based on Parallel Manipulators With Delta-Like Architecture. IEEE Robotics Autom. Lett. 2(3): 1802-1808 (2017) - [c17]Markus Kruber, Marco E. Lübbecke, Axel Parmentier:
Learning When to Use a Decomposition. CPAIOR 2017: 202-210 - 2016
- [j23]Sebastian Goderbauer, Björn Bahl, Philip Voll, Marco E. Lübbecke, André Bardow, Arie M. C. A. Koster:
An adaptive discretization MINLP algorithm for optimal synthesis of decentralized energy supply systems. Comput. Chem. Eng. 95: 38-48 (2016) - [j22]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Tools for primal degenerate linear programs: IPS, DCA, and PE. EURO J. Transp. Logist. 5(2): 161-204 (2016) - [j21]Martin Bergner, Marco E. Lübbecke, Jonas T. Witt:
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. ACM J. Exp. Algorithmics 21(1): 1.2:1-1.2:16 (2016) - [e2]Marco E. Lübbecke, Arie Koster, Peter Letmathe, Reinhard Madlener, Britta Peis, Grit Walther:
Operations Research Proceedings 2014, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), RWTH Aachen University, Germany, September 2-5, 2014. Springer 2016, ISBN 978-3-319-28695-2 [contents] - 2015
- [j20]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
About the minimum mean cycle-canceling algorithm. Discret. Appl. Math. 196: 115-134 (2015) - [j19]Eamonn T. Coughlan, Marco E. Lübbecke, Jens Schulz:
A branch-price-and-cut algorithm for multi-mode resource leveling. Eur. J. Oper. Res. 245(1): 70-80 (2015) - [j18]Martin Bergner, Alberto Caprara, Alberto Ceselli, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - [c16]Marco E. Lübbecke, Jonas T. Witt:
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. SEA 2015: 110-121 - 2014
- [j17]Jacques Desrosiers, Jean Bertrand Gauthier, Marco E. Lübbecke:
Row-reduced column generation for degenerate master problems. Eur. J. Oper. Res. 236(2): 453-460 (2014) - [j16]Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Decomposition theorems for linear programs. Oper. Res. Lett. 42(8): 553-557 (2014) - [c15]Martin Bergner, Marco E. Lübbecke, Jonas T. Witt:
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. SEA 2014: 34-45 - 2012
- [j15]Gerald Lach, Marco E. Lübbecke:
Curriculum based course timetabling: new solutions to Udine benchmark instances. Ann. Oper. Res. 194(1): 255-272 (2012) - [c14]Marco E. Lübbecke:
Automatic Decomposition and Branch-and-Price - A Status Report. SEA 2012: 1-8 - 2011
- [j14]Wiebke Höhn, Felix G. König, Rolf H. Möhring, Marco E. Lübbecke:
Integrated Sequencing and Scheduling in Coil Coating. Manag. Sci. 57(4): 647-666 (2011) - [c13]Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51 - [c12]Marco E. Lübbecke, Christian Puchert:
Primal Heuristics for Branch-and-Price Algorithms. OR 2011: 65-70 - 2010
- [c11]Thomas Erlebach, Marco E. Lübbecke:
Frontmatter, Table of Contents, Preface, Organization. ATMOS 2010 - [c10]Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz:
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317 - [c9]Eamonn T. Coughlan, Marco E. Lübbecke, Jens Schulz:
A Branch-and-Price Algorithm for Multi-mode Resource Leveling. SEA 2010: 226-238 - [c8]Gerald Gamrath, Marco E. Lübbecke:
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. SEA 2010: 239-252 - [e1]Thomas Erlebach, Marco E. Lübbecke:
ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010. OASIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2010 [contents]
2000 – 2009
- 2009
- [p1]Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller:
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27 - [i2]Wiebke Höhn, Felix G. König, Marco E. Lübbecke, Rolf H. Möhring:
Sequencing and Scheduling in Coil Coating with Shuttles. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j13]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. 40(4): 595-621 (2008) - [j12]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Preface. Discret. Math. 308(8): 1347-1349 (2008) - [j11]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann:
On minimum k-modal partitions of permutations. J. Discrete Algorithms 6(3): 381-392 (2008) - [j10]Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling:
Optimizing the Cargo Express Service of Swiss Federal Railways. Transp. Sci. 42(4): 450-465 (2008) - [c7]Felix G. König, Marco E. Lübbecke:
Sorting with Complete Networks of Stacks. ISAAC 2008: 895-906 - [c6]Gerald Lach, Marco E. Lübbecke:
Optimal University Course Timetables and the Partial Transversal Polytope. WEA 2008: 235-248 - 2007
- [j9]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007) - [c5]Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke:
Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA 2007: 729-740 - 2006
- [j8]Laura Heinrich-Litan, Marco E. Lübbecke:
Rectangle covers revisited computationally. ACM J. Exp. Algorithmics 11 (2006) - [c4]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann:
On Minimum k-Modal Partitions of Permutations. LATIN 2006: 374-385 - 2005
- [j7]Daniel Villeneuve, Jacques Desrosiers, Marco E. Lübbecke, François Soumis:
On Compact Formulations for Integer Programs Solved by Column Generation. Ann. Oper. Res. 139(1): 375-388 (2005) - [j6]Marco E. Lübbecke, Uwe T. Zimmermann:
Shunting Minimal Rail Car Allocation. Comput. Optim. Appl. 31(3): 295-308 (2005) - [j5]Marco E. Lübbecke:
Dual variable based fathoming in dynamic programs for column generation. Eur. J. Oper. Res. 162(1): 122-125 (2005) - [j4]Marco E. Lübbecke, Jacques Desrosiers:
Selected Topics in Column Generation. Oper. Res. 53(6): 1007-1023 (2005) - [c3]Laura Heinrich-Litan, Marco E. Lübbecke:
Rectangle Covers Revisited Computationally. WEA 2005: 55-66 - 2004
- [j3]Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke:
A fast algorithm for near cost optimal line plans. Math. Methods Oper. Res. 59(2): 205-220 (2004) - [c2]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446 - 2003
- [j2]Marco E. Lübbecke, Uwe T. Zimmermann:
Engine Routing and Scheduling at Industrial In-Plant Railroads. Transp. Sci. 37(2): 183-197 (2003) - [i1]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. CoRR cs.CG/0310034 (2003) - 2002
- [c1]Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke:
MaxFlow-MinCut Duality for a Paint Shop Problem. OR 2002: 377-382
1990 – 1999
- 1998
- [j1]Michael R. Bussieck, Marco E. Lübbecke:
The vertex set of a 0/1-polytope is strongly P-enumerable. Comput. Geom. 11(2): 103-109 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
