Technical Reports 2011

OR-11-1
On the Practical Strength of Two Row Tableau Cuts
S.S. Dey, A. Lodi, A. Tramontani, L.A. Wolsey

OR-11-2
On Counting Lattice Points and Chvàtal-Gomory Cutting Planes
A. Lodi, L. M. Rousseau, G. Pesant

OR-11-3
Bilevel Programming and Maximally Violated Valid Inequalities
A. Lodi, T.K. Ralphs, G. Woeginger

OR-11-4
Finding Cliques of Maximum Weight on a Generalization of Permutation Graphs
V. Cacchiani, A. Caprara, P. Toth

OR-11-5
Delay Robust Event Networks
A. Caprara, L. Galli, S. Stiller, P. Toth

OR-11-6
Improving Spectral Bounds for Clustering Problems by Lagrangian Relaxation
M. Dolatabadi, A. Lodi, Z. Afsharnejad

OR-11-7
Optimistic MILP Modeling of Non-linear Optimization Problems
R. Rovatti, C. D'Ambrosio, A. Lodi, S. Martello

OR-11-8
Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs
M. Bergner, A. Caprara, A. Ceselli, F. Furini, M. Lübbecke, E. Malaguti, E. Traversi

OR-11-9
Interdiction Branching
A. Lodi, T.K. Ralphs, F. Rossi, S. Smriglio

OR-11-10
Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems
P. Bonami, J. Linderoth, A. Lodi

OR-11-11
The Heuristic (Dark) Side of MIP Solvers
A. Lodi, T.K. Ralphs, F. Rossi, S. Smriglio

OR-11-12
Exact Weighted Vertex Coloring via Branch-and-Price
F. Furini, E. Malaguti

OR-11-13
Bin Packing Approximation Algorithms: Survey and Classification
E.G. Coffman, Jr., J. Csirik, G. Galambos, S. Martello, D. Vigo

OR-11-14
Models and Algorithms for Robust Network Design with Several Traffic Scenarios
Eduardo Alvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt