๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A heuristic for packing boxes into a container

โœ Scribed by J.A. George; D.F. Robinson

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
877 KB
Volume
7
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Effective methods for a container packin
Effective methods for a container packing operation
โœ J. Xue; K.K. Lai ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

China started its economic reform, many Hong Kong companies have moved to China. While reducing labor costs, the move has also increased transportation costs. In some cases, transportation cost can reach 30% of total product cost. This work is based on the cargo loading operation of a Hong Kong man

Container packing in a multi-customer de
Container packing in a multi-customer delivering operation
โœ K.K. Lai; J. Xue; B. Xu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

We give a graph-theoretic model and two solution methods for a container packing problem arisinf from a multi-customer delivering operation, where the customer cargoes have different sizes and each kind of cargo has limited quantity. We will also discuss our computation experiment results in finding

Packing squares into a square
Packing squares into a square
โœ Joseph Y-T. Leung; Tommy W. Tam; C.S. Wong; Gilbert H. Young; Francis Y.L. Chin ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB
Packing smaller graphs into a graph
Packing smaller graphs into a graph
โœ Jin Akiyama; Fumi Nakada; Sinichi Tokunaga ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

Let G be a graph. Given an integer m < IV(G)l, we obtain a lower bound for the largest number of vertex-disjoint subgraphs of G, each of which has m vertices.