A dynamic adaptive local search algorithm for the circular packing problem-Reference-Cited by-同舟云学术

A dynamic adaptive local search algorithm for the circular packing problem

Published:2007-12 Issue:3 Volume:183 Page:1280-1294
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hifi M.,M’Hallah R.

Publisher

Elsevier BV

Subject

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

Reference19 articles.

1. Cutting and packing;Bischoff;European Journal of Operational Research,1995

2. Palletisation of cylinders in cases;Dowsland;OR Spektrum,1991

3. Cutting and packing (C&P);Dyckhoff,1997

4. Packing different-sized circles into a rectangular container;George;European Journal of Operational Research,1995

5. Repeated patterns of dense packings of equal disks in a square;Graham;The Electronic Journal of Combinatorics,1996

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

1. Searching for the maximal packing fraction of hard disks confined by a circular cavity through replica exchange/event-chain Monte Carlo;The Journal of Chemical Physics;2024-07-24

2. MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM;Journal of the Operations Research Society of Japan;2023-07-31

3. Effect of Wrapping Force on the Effective Elastic Behavior of Packed Cylinders;Journal of Applied Mechanics;2022-12-02

4. Iterated dynamic thresholding search for packing equal circles into a circular container;European Journal of Operational Research;2022-05

5. SetMargin loss applied to deep keystroke biometrics with circle packing interpretation;Pattern Recognition;2022-02