Technical Reports 2011
OR-11-1
On the Practical Strength of Two Row Tableau Cuts
OR-11-2
On Counting Lattice Points and Chvàtal-Gomory Cutting Planes
OR-11-3
Bilevel Programming and Maximally Violated Valid Inequalities
OR-11-4
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs
OR-11-5
Delay Robust Event Networks
OR-11-6
Improving Spectral Bounds for Clustering Problems by Lagrangian Relaxation
OR-11-7
Optimistic MILP Modeling of Non-linear Optimization Problems
OR-11-8
Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs
OR-11-9
Interdiction Branching
OR-11-10
Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems
OR-11-11
The Heuristic (Dark) Side of MIP Solvers
OR-11-12
Exact Weighted Vertex Coloring via Branch-and-Price
OR-11-13
Bin Packing Approximation Algorithms: Survey and Classification
OR-11-14
Models and Algorithms for Robust Network Design with Several Traffic Scenarios