Improved local search algorithms for the rectangle packing problem with general spatial costs-Reference-Cited by-同舟云学术

Improved local search algorithms for the rectangle packing problem with general spatial costs

Published:2005-11 Issue:1 Volume:167 Page:48-67
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Imahori S.,Yagiura M.,Ibaraki T.

Publisher

Elsevier BV

Subject

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

Reference20 articles.

1. The bottom-left bin-packing heuristic: an efficient implementation;Chazelle;IEEE Transactions on Computers,1983

2. Packing problems;Dowsland;European Journal of Operational Research,1992

3. Cutting and Packing in Production and Distribution;Dyckhoff,1992

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. Multistage cutting stock problems of two and more dimensions;Gilmore;Operations Research,1965

Cited by 25 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. An adaptive selection approach for the 2D rectangle packing area minimization problem;Omega;2018-10

3. A Hybridized Evolutionary Algorithm for Bi-objective Bi-dimensional Bin-packing Problem;Communications in Computer and Information Science;2017

4. Handling precedence constraints in scheduling problems by the sequence pair representation;Journal of Combinatorial Optimization;2015-11-06

5. Dynamic reduction heuristics for the rectangle packing area minimization problem;European Journal of Operational Research;2015-03