A greedy search for the three‐dimensional bin packing problem: the packing static stability case
Copyright policy )A greedy search for the three‐dimensional bin packing problem: the packing static stability case
We suggest a greedy search heuristic for solving the three‐dimensional bin packing problem (3D‐BPP) where in addition to the usual requirement of minimum amount of bins being used, the resulting packing of items into the bins must be physically stable. The problem is NP‐hard in the strong sense and imposes severe computational strain for solving it in practice. Computational experiments are also presented and the results are compared with those obtained by the Martello, Pisinger and Vigo (2000) heuristic.
Combinatorial optimization, Discrete location and assignment, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Combinatorial aspects of packing and covering
Combinatorial optimization, Discrete location and assignment, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Combinatorial aspects of packing and covering
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).58 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!