Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
From MaRDI portal
Publication:4212713
DOI10.1016/S0969-6016(98)00003-3zbMath0910.90240OpenAlexW2051575955WikidataQ127753647 ScholiaQ127753647MaRDI QIDQ4212713
Publication date: 3 December 1998
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0969-6016(98)00003-3
Related Items (35)
A simulated annealing approach for the circular cutting problem ⋮ A mathematical model and a solution method for the problem of placing various-sized circles into a strip ⋮ Algorithms for the two dimensional bin packing problem with partial conflicts ⋮ Solving nesting problems with non-convex polygons by constraint logic programming ⋮ An improved typology of cutting and packing problems ⋮ A dynamic adaptive local search algorithm for the circular packing problem ⋮ 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 three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Efficiently packing unequal disks in a circle ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Approximate algorithms for constrained circular cutting problems ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors ⋮ Adaptive beam search lookahead algorithms for the circular packing problem ⋮ Packing identical spheres into a cylinder ⋮ Minimizing the object dimensions in circle and sphere packing problems ⋮ Efficient approaches for furnace loading of cylindrical parts ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ The antennas preassignment problem ⋮ New heuristics for packing unequal circles into a circular container ⋮ A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Cylinder packing by simulated annealing ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ Packing cylinders and rectangular parallelepipeds with distances between them into a given region ⋮ Column enumeration based decomposition techniques for a class of non-convex MINLP problems ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure
This page was built for publication: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
