Mathematical programming algorithms for bin packing problems with item fragmentation
| Year of publication: |
2014
|
|---|---|
| Authors: | Casazza, Marco ; Ceselli, Alberto |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 46.2014, p. 1-11
|
| Subject: | Bin packing | Item fragmentation | Mathematical programming | Branch-and-price | Mathematische Optimierung | Packproblem | Packing problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Exactly solving packing problems with fragmentation
Casazza, Marco, (2016)
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Delorme, Maxence, (2020)
- More ...
-
Casazza, Marco, (2021)
-
Exactly solving packing problems with fragmentation
Casazza, Marco, (2016)
-
Optimization algorithms for resilient path selection in networks
Casazza, Marco, (2021)
- More ...