Technical Reports 2013
OR-13-1
(revised OR-14-20)
Experiments with Linear vs Nonlinear Formulations of SVM with Ramp Loss
OR-13-2
A study on the computational complexity of the bilevel knapsack problem
OR-13-3
On Exact Solutions for the Minmax Regret Spanning Tree
OR-13-4
Optimizing the Design of Water Distribution Networks Using Mathematical Optimization
OR-13-5
Tree Search Stabilization by Random Sampling
OR-13-6
A Heuristic Approach for an Integrated Fleet- Assignment, Aircraft-Routing and Crew-Pairing Problem
OR-13-7
An Overview of Recovery Models and Algorithms for Real-time Railway Rescheduling
OR-13-8
The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation
OR-13-9
A Tutorial on Non-Periodic Train Timetabling and Train Platforming Problems
OR-13-10
A Reduced-Cost Iterated Local Search Heuristic for the Fixed Charge Transportation Problem
OR-13-11
Generation of antipodal random vectors with prescribed non-stationary 2-nd order statistics
OR-13-12
(OR-12-2 revision)
Design and Control of Public-Service Contracts and an Application to Public Transportation Systems
OR-13-13
On the difficulty of Virtual Private Network Instances
OR-13-14
Single-commodity Robust Network Design Problem: Complexity, Instances and Heuristic Solutions
OR-13-15
A Branch-and-Price Algorithm for the (k, c) - Coloring Problem
OR-13-16
Tree Search Stabilization by Random Sampling
OR-13-17
Solving the optimum system traffic assignment problem for Personal Rapid Transit networks using the Frank-Wolfe algorithm
OR-13-18
An Efficient Approach for Solving Large Stochastic Unit Commitment Problems Arising in a California ISO Planning Model