Pages that link to "Item:Q1877898"

The following pages link to A mathematical model and a solution method for the problem of placing various-sized circles into a strip (Q1877898):

Displaying 33 items.

• Packing ellipsoids by nonlinear optimization (Q312475) (← links)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• Packing unequal spheres into various containers (Q334249) (← links)
• An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
• An anchorage planning strategy with safety and utilization considerations (Q337616) (← links)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← 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)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
• A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
• PERM for solving circle packing problem (Q2459405) (← 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)
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
• Recursive circle packing problems (Q2803272) (← links)
• A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
• GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612) (← links)
• A model to design recreational boat mooring fields (Q3621925) (← links)
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints (Q4212713) (← links)
• Packing circles within ellipses (Q4924059) (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)
• Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
• Placing your Coins on a Shelf (Q5136217) (← links)