2 papers
cs.DS2016
The matching relaxation for a class of generalized set partitioning problems
Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia +1
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints.…
math.OC2016
A Decomposition Approach to Solve The Quay Crane Scheduling Problem
Afonso Sampaio, Sebastián Urrutia, Johan Oppen
In this work we propose a decomposition approach to solve the quay crane scheduling problem. This is an important maritime transportation problem faced in container terminals where…