Algorithms for the circular two-dimensional open dimension problem
From MaRDI portal
Publication:4600628
Recommendations
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Adaptive algorithms for circular cutting/packing problems
- Approximate algorithms for constrained circular cutting problems
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- A hybrid beam search looking-ahead algorithm for the circular packing problem
Cited in
(12)- Packing unequal circles into a strip of minimal length with a jump algorithm
- Discrete‐event simulation is still alive and strong: evidence from bibliometric performance evaluation of research during COVID‐19 global health pandemic
- Optimized packing multidimensional hyperspheres: a unified approach
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A literature review on circle and sphere packing problems: models and methodologies
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- An anchorage planning strategy with safety and utilization considerations
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Approximate algorithms for constrained circular cutting problems
- Iterated tabu search for the circular open dimension problem
- Solving the two-dimensional CIS problem by a rational algorithm
- Packing non-identical circles within a rectangle with open length
This page was built for publication: Algorithms for the circular two-dimensional open dimension problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600628)
