Sequencing and Scheduling in Coil Coating with Shuttles (2009)
Höhn, Wiebke, König, Felix G., Lübbecke, Marco E., Möhring, Rolf H.
Applying combinatorial optimization in real life yields cost savings delighting the industry. Beyond that, at the core of some applications also lies a pretty (sub)problem rejoicing the...
Rectangle covers revisited computationally (2008)
Laura Heinrich-litan, Marco E. Lübbecke
Abstract. We consider the problem of covering an orthogonal polygon with a minimum number of axis-parallel rectangles from a computational point of view. We propose an integer program which is the...
Abstract Minimizing the Stabbing Number of Matchings, Trees, and (2008)
Sándor P. Fekete, Marco E. Lübbecke
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...
Rectangle covers revisited computationally (2008)
Laura Heinrich-litan, Marco E. Lübbecke
Abstract. We consider the problem of covering an orthogonal polygon with a minimum number of axis-parallel rectangles from a computational point of view. We propose an integer program which is the...
Chapter 1 A PRIMER IN COLUMN GENERATION (2008)
Jacques Desrosiers, Marco E. Lübbecke
Abstract We give a didactic introduction to the use of the column generation technique in linear and in particular in integer programming. We touch on both, the relevant basic theory and more...
Combinatorially Simple Pickup and Delivery Paths (2007)
Pickup and delivery problems discussed in the literature are often constrained to particularly simple solutions in terms of the sequence of visited locations. We study the very simplest pickup and...
Optimal University Course Timetables and the Partial (2007)
Transversal Polytope, Gerald Lach, Marco E. Lübbecke
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...
Optimizing the Cargo Express Service of Swiss Federal Railways (2006)
Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling
Abstract. The Cargo Express service of Swiss Federal Railways (SBB Cargo) offers fast overnight transportation of goods between selected train stations in Switzerland and is operated as a...
On minimum kmodal partitions of permutations (2006)
Gabriele Di Stefano, Marco E. Lübbecke, Uwet. Zimmermann
Abstract. Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result to minimum partitioning into k-modal subsequences, that is,...
Dual variable based fathoming in dynamic programs for column generation (2005)
In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from...
Selected topics in column generation (2005)
Marco E. Lübbecke, Jacques Desrosiers
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate the approaches, and survey mainly recent...
Dual variable based fathoming in dynamic programs for column generation (2005)
Marco E. Lübbecke, Marco E. Lübbecke
In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from...
Selected topics in column generation (2005)
Marco E. Lübbecke, Jacques Desrosiers
informs ® doi 10.1287/opre.1050.0234 © 2005 INFORMS Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large-scale integer programming. We outline...
Computer Aided Scheduling of Switching Engines (2003)
Marco E. Lübbecke, Uwe T. Zimmermann
Scheduling the switching engines of an industrial railroad is a formidable and responsible task, closely related to the well-studied pickup and delivery problem with time windows. Aiming at an ecient...
Dual Variable Based Fathoming in Dynamic Programs for Column Generation (2003)
In column generation schemes, particularly those proposed for set partitioning type problems, dynamic programming algorithms are applied to solve the respective pricing subproblem. In addition to...
On Compact Formulations For Integer Programs Solved By Column Generation (2003)
Daniel Villeneuve, Daniel Villeneuve, Jacques Desrosiers, Jacques Desrosiers, Marco E. Lübbecke, F. Soumis
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subproblem and branching...
(will be inserted by the editor) A Fast Algorithm for Near Cost Optimal Line Plans (2003)
Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke, Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke
Abstract We consider the design of line plans in public transport at a minimal total cost. Both, linear and nonlinear integer programming are adequate and intuitive modeling approaches for this...
On compact formulations for integer programs solved by column generation (2003)
Daniel Villeneuve, Daniel Villeneuve, Jacques Desrosiers, Jacques Desrosiers, Marco E. Lübbecke, Marco E. Lübbecke, ...
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subproblem and branching...
Abstract Pickup and delivery problems discussed in the literature are often constrained to particularly simple solutions in terms of the sequence of visited locations. We study the very simplest...
On compact formulations for integer programs solved by column generation (2003)
D. Villeneuve, J. Desrosiers, M. E. Lübbecke, F. Soumis, Daniel Villeneuve, Jacques Desrosiers, ...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du...
Dual Variable Based Fathoming in Dynamic Programs for Column Generation (2003)
Marco E. Lübbecke, Marco E. Lubbecke
In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from...
Dual Variable Based Fathoming in Dynamic Programs for Column Generation (2003)
In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from...
To appear in Operations Research. Selected Topics in Column Generation (2002)
Marco E. Lübbecke, Jacques Desrosiers
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate the approaches, and survey mainly recent...
Selected topics in column generation (2002)
Marco E. Lübbecke, Jacques Desrosiers
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate the approaches, and survey mainly recent...
To appear in Operations Research. Selected Topics in Column Generation (2002)
Marco E. Lübbecke, Jacques Desrosiers
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate the approaches, and survey mainly recent...
A Fast Algorithm for Near Cost Optimal Line Plans (2002)
Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke
We consider the design of lines in public transport at a minimal total cost. Both, linear and nonlinear integer programming are adequate and intuitive modeling approaches for this problem. We present...
fish stiqz fish@analog.org. Redhat linux restore insecure environment variables vulnerability (2000)
Pickup and delivery problems discussed in the literature often allow for only particularly simple solutions in terms of the sequence of visited locations. We study the very simplest pickup and...
The Vertex Set of a 0/1-Polytope is Strongly P-Enumerable (1998)
Michael R. Bussieck, Marco E. Lübbecke
In this paper, we discuss the computational complexity of the following enumeration problem: Given a rational convex polyhedron P defined by a system of linear inequalities, output each vertex of P ....
The Vertex Set of a 0/1-Polytope is Strongly P-Enumerable (1998)
Michael R. Bussieck, Marco E. Lübbecke
In this paper, we discuss the computational complexity of the following enumeration problem: Given a rational convex polyhedron P defined by a system of linear inequalities, output each vertex of P ....
Yet another note on “An efficient zero-one formulation of the multilevel lot-sizing problem (1998)
Michael R. Bussieck, Andreas Fink, Marco E. Lübbecke
In “An Efficient Zero-One Formulation of the Multilevel Lot-Sizing Problem ” [8] MCKNEW, SAY-DAM, and COLEMAN claim the polynomial solvability of this particular production planning problem....
Yet Another Note on "An Efficient Zero-One Formulation of the Multilevel Lot-Sizing Problem" (1998)
Michael R. Bussieck, Andreas Fink, Marco E. Lübbecke
In "An Efficient Zero-One Formulation of the Multilevel Lot-Sizing Problem" [8] MCKNEW, SAY- DAM, and COLEMAN claim the polynomial solvability of this particular production planning...