Technical Reports 2003

OR-03-1
A set covering based heuristic approach for Bin-Packing problems
M. Monaci, P. Toth

OR-03-2
A lagrangian heuristic approach to real-world train timetabling problems
A. Caprara, M. Monaci, P. Toth, P.L. Guida

OR-03-3
Discrepancy-based additive bounding for the alldifferent constraint
A. Lodi, M. Milano, L.-M. Rousseau

OR-03-4
An exact algorithm for the symmetric capacitated vehicle routing problem with two dimensional loading constraints
M. Iori, J. J. Salazar Gonzalez, D. Vigo

OR-03-5
On d-Threshold Graphs and d-dimensional bin packing
A. Caprara, A. Lodi, R. Rizzi

OR-03-6
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
A. Caprara, A. Lodi, M. Monaci

OR-03-7
Lower Bounds and Heuristic Algorithms for the ki-Partitioning Problem
M. Dell'Amico, M. Iori, S. Martello, M. Monaci

OR-03-8
Exact approaches for the two-dimensional protein folding problem
A. Caprara, M. Iori

OR-03-9
Discrepancy-based additive bounding procedures
A. Lodi, M. Milano, L.M. Rousseau

OR-03-10
The Feasibility Pump
M. Fischetti, F. Glover, A. Lodi

OR-03-11
Separating Simple Domino Parity Inequalities
L.K. Fleisher, A.N. Letchford, A. Lodi

OR-03-12
Optimizing over Semimetric Polytopes
A. Frangioni, A. Lodi, G. Rinaldi

OR-03-13
Computing good allocations for combinatorial optimization games
A. Caprara, A.N. Letchford