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 |
-
Mathematical programming algorithms for bin packing problems with item fragmentation
Casazza, Marco, (2014)
-
Semi-on-line bin packing : a short overview and a new lower bound
Balogh, János, (2013)
-
Omar, Mohamed K., (2013)
- 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)
-
New models for the robust shortest path problem : complexity, resolution and generalization
Gabrel, Virginie, (2013)
- More ...