Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search-Reference-Cited by-同舟云学术

Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search

Published:2012 Issue: Volume: Page:456-463
ISSN:0302-9743
Container-title:Computer Aided Systems Theory – EUROCAST 2011
language:
Short-container-title:

Author:

Chwatal Andreas M.,Pirkwieser Sandro

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-27549-4_58

Reference14 articles.

1. Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44(2), 145–159 (1990)

2. Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183, 1109–1130 (2007)

3. Ntene, N.: An Algorithmic Approach to the 2D Oriented Strip Packing Problem. PhD thesis, University of Stellenbosch, South Africa (2007)

4. Garey, M.R., Johnson, D.S.: “Strong” NP-completeness results: Motivation, examples, and implications. Journal of the ACM 25, 499–508 (1978)

5. Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141, 241–252 (2002)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers;Journal of Industrial and Management Optimization;2023

2. A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects;Journal of Heuristics;2018-07-05

3. Two-Dimensional Bin Packing;Introduction to Cutting and Packing Optimization;2017-10-24

4. A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints;Computers & Operations Research;2017-02