Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
| Year of publication: |
2014
|
|---|---|
| Authors: | Hifi, Mhand ; Negre, Stéphane ; Wu, Lei |
| Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 21.2014, 1, p. 59-79
|
| Subject: | bin packing | heuristics | linear programming | two-dimensional knapsack | Heuristik | Heuristics | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Chance-constrained multiple bin packing problem with an application to operating room planning
Wang, Shanshan, (2021)
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
-
Periodic chains scheduling on dedicated resources : a crucial problem in time-sensitive networks
Grus, Josef, (2025)
- More ...
-
An exact decomposition algorithm for the generalized knapsack sharing problem
Dahmani, Isma, (2016)
-
A cross-cultural study of ESG impact on corporate performance and equity
Wu, Lei, (2024)
-
Digital banking and deposit : substitution effect of mobile applications on web services
Wu, Lei, (2023)
- More ...