Orientational variable-length strip covering problem : a branch-and-price-based algorithm
Year of publication: |
2021
|
---|---|
Authors: | Hu, Xiaoxuan ; Zhu, Waiming ; Ma, Huawei ; An, Bo ; Zhi, Yanling ; Wu, Yi |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 1 (16.2.), p. 254-269
|
Subject: | Covering problem | Strip covering problem | EOS scheduling | Dominance rule | Nested grids | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Packproblem | Packing problem | Theorie | Theory |
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
-
Development of a stochastic optimisation tool for solving the multiple container packing problems
Thapatsuwan, Peeraya, (2012)
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
- More ...
-
Hu, Xiaoxuan, (2019)
-
Wu, Yi, (2022)
-
CSR preference, market competition, and corporate financial performance
Deng, Dejun, (2023)
- More ...