Skip to main content

Publisher: Elsevier

Volume 141, Number 2, 1 September 2002

Cutting and packing
pp. 239-240(2)
Authors: Wang, P.Y.; Wascher, G.

Favourites:
ADD

Two-dimensional packing problems: A survey
pp. 241-252(12)
Authors: Lodi, A.; Martello, S.; Monaci, M.

Favourites:
ADD

LP models for bin packing and cutting stock problems
pp. 253-273(21)
Author: Valerio de Carvalho, J.M.

Favourites:
ADD
Favourites:
ADD

Modeling multistage cutting stock problems
pp. 313-327(15)
Author: Zak, E.J.

Favourites:
ADD

An effective quasi-human based heuristic for solving the rectangle packing problem
pp. 341-358(18)
Authors: Wu Y.-L.; Huang, W.; Lau, S.; Wong, C.K.; Young, G.H.

Favourites:
ADD

A 2-exchange heuristic for nesting problems
pp. 359-370(12)
Authors: Gomes, A.M.; Oliveira, J.F.

Favourites:
ADD

An algorithm for polygon placement using a bottom-left strategy
pp. 371-381(11)
Authors: Dowsland, K.A.; Vaid, S.; Dowsland, W.B.

Favourites:
ADD

Heuristics for the container loading problem
pp. 382-392(11)
Author: Pisinger, D.

Favourites:
ADD
Favourites:
ADD

Heuristic algorithms for the three-dimensional bin packing problem
pp. 410-420(11)
Authors: Lodi, A.; Martello, S.; Vigo, D.

Favourites:
ADD
Favourites:
ADD

An improved algorithm for the packing of unequal circles within a larger containing circle
pp. 440-453(14)
Authors: Wang, H.; Huang, W.; Zhang, Q.; Xu, D.

Favourites:
ADD
Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more