Technical Reports 2003
OR-03-1
A set covering based heuristic approach for Bin-Packing problems
OR-03-2
A lagrangian heuristic approach to real-world train timetabling problems
OR-03-3
Discrepancy-based additive bounding for the alldifferent constraint
OR-03-4
An exact algorithm for the symmetric capacitated vehicle routing problem with two dimensional loading constraints
OR-03-5
On d-Threshold Graphs and d-dimensional bin packing
OR-03-6
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
OR-03-7
Lower Bounds and Heuristic Algorithms for the ki-Partitioning Problem
OR-03-8
Exact approaches for the two-dimensional protein folding problem
OR-03-9
Discrepancy-based additive bounding procedures
OR-03-10
The Feasibility Pump
OR-03-11
Separating Simple Domino Parity Inequalities
OR-03-12
Optimizing over Semimetric Polytopes
OR-03-13
Computing good allocations for combinatorial optimization games