An approximation algorithm for solving unconstrained two-dimensional knapsack problems-Reference-Cited by-同舟云学术

An approximation algorithm for solving unconstrained two-dimensional knapsack problems

Published:1995-08 Issue:3 Volume:84 Page:618-632
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fayard Didier,Zissimopoulos Vassilis

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference26 articles.

1. A solution of the rectangular cutting-stock problem;Adamowicz;IEEE Transactions on Systems, Man and Cybernetics,1976

2. An algorithm for large knapsack problems;Balas;Operations Research,1980

3. The Cutting Stock Problem in the flat glass industry - Selection of stock sizes;Chambers;Operational Research Quarterly,1976

4. An algorithm for two-dimensional cutting problems;Christofides;Operations Research,1977

5. Multiprogram scheduling;Codd;Communications of the ACM,1960

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

1. Grids for cutting and packing problems: a study in the 2D knapsack problem;4OR;2019-09-24

2. Two-dimensional knapsack-block packing problem;Applied Mathematical Modelling;2019-09

3. A heuristic approach to stowing general cargo into platform supply vessels;Journal of the Operational Research Society;2016-01

4. R-Storm;Proceedings of the 16th Annual Middleware Conference;2015-11-24

5. A deterministic algorithm for generating optimal three-stage layouts of homogenous strip pieces;Journal of Industrial Engineering and Management;2014-10-30