A branch-and-cut algorithm for the restricted Block Relocation Problem
Year of publication: |
2020
|
---|---|
Authors: | Bacci, Tiziano ; Mattia, Sara ; Ventura, Paolo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 287.2020, 2 (1.12.), p. 452-459
|
Subject: | Block Relocation problem | Branch-and-cut | Integer Programming formulation | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem
Gaar, Elisabeth, (2022)
-
A new modeling approach for the unrestricted block relocation problem
Kimms, Alf, (2023)
-
Galle, Virgile, (2018)
- More ...
-
The bounded beam search algorithm for the block relocation problem
Bacci, Tiziano, (2019)
-
Bacci, Tiziano, (2024)
-
Solving survivable two-layer network design problems by metric inequalities
Mattia, Sara, (2012)
- More ...