Approximate algorithms for constrained circular cutting problems
From MaRDI portal
Recommendations
- Adaptive algorithms for circular cutting/packing problems
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- A simulated annealing approach for the circular cutting problem
- Algorithms for the circular two-dimensional open dimension problem
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- A genetic algorithm for the set covering problem
- An Algorithm for Two-Dimensional Cutting Problems
- An and-or-graph approach for two-dimensional cutting problems
- Integrated container loading software for pulp and paper industry
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Multistage Cutting Stock Problems of Two and More Dimensions
- Packing different-sized circles into a rectangular container
- Packing problems
- Repeated patterns of dense packings of equal disks in a square
Cited in
(34)- Convex maximization formulation of general sphere packing problem
- A simulated annealing approach for the circular cutting problem
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- A dynamic adaptive local search algorithm for the circular packing problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A local search-based method for sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- Algorithms for the circular two-dimensional open dimension problem
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
- Adaptive large neighborhood search for solving the circle bin packing problem
- A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
- A beam search algorithm for the circular packing problem
- A memetic algorithm to pack unequal circles into a square
- Packing non-identical circles within a rectangle with open length
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- An improved typology of cutting and packing problems
- Valid constraints for the Point Packing in a Square problem
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Optimal control sphere packing problem
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A literature review on circle and sphere packing problems: models and methodologies
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- An anchorage planning strategy with safety and utilization considerations
- Packing unequal circles into a strip of minimal length with a jump algorithm
- High density packings of equal circles in rectangles with variable aspect ratio
- Adaptive algorithms for circular cutting/packing problems
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- PERM for solving circle packing problem
This page was built for publication: Approximate algorithms for constrained circular cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433164)
