Computational Science - ICCS 2004
From MaRDI portal
Publication:5712866
DOI10.1007/B97987zbMATH Open1095.90591OpenAlexW4205955456MaRDI QIDQ5712866FDOQ5712866
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97987
Recommendations
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- A simulated annealing approach for the circular cutting problem
- Annealing, Cylinder Packing By Simulated
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (5)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A simulated annealing approach for the circular cutting problem
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- A heuristic quasi-physical strategy for solving disks packing problem
This page was built for publication: Computational Science - ICCS 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712866)