most citedA Decomposition Approach to Solve The Quay Crane Scheduling Problem

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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.…