A new heuristic algorithm for the circular packing problem with equilibrium constraints
From MaRDI portal
Publication:350917
DOI10.1007/S11432-011-4351-3zbMath1267.68213OpenAlexW2078444123MaRDI QIDQ350917
Gang Li, Jing-Fa Liu, Huan-Tong Geng
Publication date: 3 July 2013
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4351-3
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
Uses Software
Cites Work
- Unnamed Item
- A short note on a simple search heuristic for the diskspacking problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Two-dimensional packing problems: a survey
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Two personification strategies for solving circles packing problem
- A caving degree approach for the single container loading problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- PERM for solving circle packing problem
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- Tabu Search—Part I
- Tabu Search—Part II
This page was built for publication: A new heuristic algorithm for the circular packing problem with equilibrium constraints