Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
| Year of publication: |
2025
|
|---|---|
| Authors: | Wang, Sunkanghong ; Yao, Shaowen ; Zhang, Hao ; Liu, Qiang ; Wei, Lijun |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 173.2025, Art.-No. 106878, p. 1-14
|
| Subject: | Packing | Fragile objects | Exact algorithm | Branch-and-price-and-cut | Arc-flow | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Ganzzahlige Optimierung | Integer programming |
-
Wang, Ting, (2022)
-
Silva, Allyson, (2021)
-
Exact and approximate methods for the score-constrained packing problem
Hawa, Asyl L., (2022)
- More ...
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
-
An exact approach for the constrained two-dimensional guillotine cutting problem with defects
Zhang, Hao, (2023)
-
Yao, Shaowen, (2024)
- More ...