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 |
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Delorme, Maxence, (2020)
-
Element-capacity difference algorithm for optimal bin packing
Shah, Deep, (2019)
- More ...
-
An exact decomposition algorithm for the generalized knapsack sharing problem
Dahmani, Isma, (2016)
-
New models for the robust shortest path problem : complexity, resolution and generalization
Gabrel, Virginie, (2013)
-
Digital banking and deposit : substitution effect of mobile applications on web services
Wu, Lei, (2023)
- More ...