Marco E. Lübbecke

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Martin Bergner

> Home > Persons > Marco E. Lübbecke

Publications

2016
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/jea/BergnerLW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/BergnerLW16
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)
2015
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/BergnerCCFLMT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/BergnerCCFLMT15
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)
2014
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/wea/BergnerLW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/BergnerLW14
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
2011
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/BergnerCFLMT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/BergnerCFLMT11
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

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.