Lower and upper bounding procedures for the bin packing problem with concave loading cost
Year of publication: |
2024
|
---|---|
Authors: | Haouari, Mohamed ; Mhiri, Mariem |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 312.2024, 1 (1.1.), p. 56-69
|
Subject: | Column generation | Combinatorial optimization | Heuristics | Lower bounds | Packing | Theorie | Theory | Heuristik | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
-
The pallet loading problem: a review of solution methods and computational experiments
Silva, Elsa, (2016)
-
The multiple container loading problem with preference
Tian, Tian, (2016)
- More ...
-
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
HazIr, Öncü, (2010)
-
Optimal Scheduling of a Two-stage Hybrid Flow Shop
Haouari, Mohamed, (2006)
-
Optimal Scheduling of a Two-stage Hybrid Flow Shop
Haouari, Mohamed, (2006)
- More ...