Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems
| Autor: | Phillippe Samer, Sebastián Urrutia, Johan Oppen, Evellyn Cavalcante |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Optimization problem Matching (graph theory) Applied Mathematics 05 social sciences 0211 other engineering and technologies 02 engineering and technology Reduction (complexity) Set (abstract data type) 0502 economics and business Container (abstract data type) Discrete Mathematics and Combinatorics Preprocessor Relaxation (approximation) Variable (mathematics) Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 55:85-88 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2016.10.022 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect