#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1997

2018

- This year (3)
- Last 5 years (21)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marco E. Lübbecke, Jacques Desrosiers
- Operations Research
- 2005

Dantzig-Wolfe decomposition and column generation, devis ed for linear programs, is a success story in large scale integer programming. We outline and rel ate the approaches, and survey mainly recent… (More)

- Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller
- Robust and Online Large-Scale Optimization
- 2009

We present a new concept for optimization under uncertainty: recoverable robustness. A solution is recovery robust if it can be recovered by limited means in all likely scenarios. Specializing the… (More)

- Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
- Discrete & Computational Geometry
- 2004

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate problems of finding… (More)

- Michael R. Bussieck, Marco E. Lübbecke
- Comput. Geom.
- 1998

In this paper, we discuss the computational complexity of the following enumeration problem: Given a rational convex polyhedron P deened by a system of linear inequalities, output each vertex of P.… (More)

- Gerald Lach, Marco E. Lübbecke
- Annals OR
- 2012

We present an integer programming approach to the university course timetabling problem, in which weekly lectures have to be scheduled and assigned to rooms. Students’ curricula impose restrictions… (More)

- Wiebke Höhn, Felix G. König, Rolf H. Möhring, Marco E. Lübbecke
- Management Science
- 2011

W consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of… (More)

- Gerald Lach, Marco E. Lübbecke
- WEA
- 2008

University course timetabling is the conflict-free assignment of courses to weekly time slots and rooms subject to various hard and soft constraints. One goal is to meet as closely as possible… (More)

Column generation is an indispensable tool in computational optimization to solve a mathematical program by iteratively adding the variables of the model. Even though the method is simple in theory… (More)

This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algorithm which turns degeneracy into a possible… (More)

In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG based on the SCIP framework. This involves new heuristics as well as heuristics from the… (More)