A mathematical model and a solution method for the problem of placing various-sized circles into a strip
From MaRDI portal
Publication:1877898
DOI10.1016/S0377-2217(03)00137-1zbMath1056.90018MaRDI QIDQ1877898
Publication date: 19 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Packing ellipsoids by nonlinear optimization, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal spheres into various containers, An action-space-based global optimization algorithm for packing circles into a square container, A memetic algorithm to pack unequal circles into a square, An anchorage planning strategy with safety and utilization considerations, High density packings of equal circles in rectangles with variable aspect ratio, Packing non-identical circles within a rectangle with open length, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, A nonlinear programming model with implicit variables for packing ellipsoids, A literature review on circle and sphere packing problems: models and methodologies, Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary, Parallel greedy algorithms for packing unequal circles into a strip or a rectangle, A heuristic approach for packing identical rectangles in convex regions, Packing unequal circles into a strip of minimal length with a jump algorithm, Solving circle packing problems by global optimization: numerical results and industrial applications, PERM for solving circle packing problem, Minimizing the object dimensions in circle and sphere packing problems, Adaptive and restarting techniques-based algorithms for circular packing problems, Packing circles within ellipses, Solving the problem of packing equal and unequal circles in a circular container, New heuristics for packing unequal circles into a circular container, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, A bi-objective guillotine cutting problem of stamping strips of equal circles, Recursive circle packing problems, Placing your Coins on a Shelf, A model to design recreational boat mooring fields, On tackling reverse convex constraints for non-overlapping of unequal circles, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles, GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID, A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure
Cites Work
- Packing different-sized circles into a rectangular container
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Orthogonal Packings in Two Dimensions
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Cylinder packing by simulated annealing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
