| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777215 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
Abstract
We investigate an optimization problem in container ports, for which previous models based on generalized set partitioning formulations have been studied. We describe two combinatorial relaxations based on computing maximum weighted matchings in suitable graphs, providing dual bounds and a variable reduction technique.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia,