A numerically exact algorithm for the bin-packing problem
Year of publication: |
2024
|
---|---|
Authors: | Baldacci, Roberto ; Coniglio, Stefano ; Cordeau, Jean-François ; Furini, Fabio |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 1, p. 141-162
|
Subject: | bin packing | branch-price-and-cut algorithm | dynamic programming | numerical precision | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Dynamische Optimierung | Dynamic programming |
-
Durak, Bahadır, (2017)
-
On the generalized bin packing problem
Baldi, Mauro Maria, (2017)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
On the exact separation of cover inequalities of maximum depth
Catanzaro, Daniele, (2021)
-
A lexicographic pricer for the fractional bin packing problem
Coniglio, Stefano, (2019)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...