New lower bounds for the three-dimensional orthogonal bin packing problem
Year of publication: |
2013
|
---|---|
Authors: | Liao, Chung-shou ; Hsu, Chia-hong |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 225.2013, 2 (01.03.), p. 244-252
|
Subject: | Packproblem | Packing problem | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
An iterated greedy algorithm for the planning of yarn-dyeing boilers
Demir, Yunus, (2024)
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
-
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
Chen, Duanbing, (2010)
- More ...
-
New lower bounds for the three-dimensional orthogonal bin packing problem
Liao, Chung-Shou, (2013)
-
New lower bounds for the three-dimensional orthogonal bin packing problem
Liao, Chung-Shou, (2013)
-
Hybrid search for the optimal PMU placement problem on a power grid
Liao, Chung-Shou, (2015)
- More ...