Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Year of publication: |
2020
|
---|---|
Authors: | Delorme, Maxence ; Iori, Manuel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 1, p. 101-119
|
Subject: | bin packing | cutting stock | pseudo-polynomial | equivalent models | variable size | fragmentation | Packproblem | Packing problem | Theorie | Theory | Heuristik | Heuristics | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Tighter bounds for the harmonic bin packing algorithm
Epstein, Leah, (2024)
- More ...
-
Mathematical models and decomposition methods for the multiple knapsack problem
Dell'Amico, Mauro, (2019)
-
Logic based Benders' decomposition for orthogonal stock cutting problems
Delorme, Maxence, (2017)
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
- More ...