Pages that link to "Item:Q4212713"

The following pages link to Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints (Q4212713):

Displaying 38 items.

• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
• Efficiently packing unequal disks in a circle (Q924882) (← links)
• Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
• A beam search algorithm for the circular packing problem (Q960400) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← links)
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
• Optimal placement of rectangles on a plane with fixed objects (Q1687016) (← links)
• The antennas preassignment problem (Q1766595) (← links)
• A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip (Q1877898) (← links)
• Efficient approaches for furnace loading of cylindrical parts (Q1994472) (← links)
• Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
• Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors (Q2460106) (← links)
• Minimax optimal placement problem for special-form objects on a multiply connected domain (Q2467984) (← links)
• Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
• An efficient deterministic optimization approach for rectangular packing problems (Q2868912) (← links)
• Algorithms for the two dimensional bin packing problem with partial conflicts (Q2893341) (← links)
• Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
• Packing identical spheres into a cylinder (Q3002688) (← links)
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
• A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
• Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103) (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)
• Cylinder packing by simulated annealing (Q5189102) (← links)
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)