Technical Reports 2015
OR-15-1
Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms
OR-15-2
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
OR-15-3
(revision OR-13-1)
On Handling Indicator Constraints in Mixed Integer Programming
OR-15-4
Models for Ecological, Economical, Efficient, Electric Car-Sharing. Problem Definition and Modeling: Station based Systems
OR-15-5
Solving Vertex Coloring Problems as Maximum Weight Stable Set Problems
OR-15-6
A study on metaheuristic approaches to the energy-efficient train timetabling problem
OR-15-7
Measuring the impact of acceptance criteria on the adaptive large neighbourhood search metaheuristic
OR-15-8
A Branch-and-Price Approach to the VRP for Feeder Network Design
OR-15-9
Nonlinear Chance-Constrained Problems with applications to Hydro Scheduling
OR-15-10
Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem