Pages that link to "Item:Q2250089"

The following pages link to Cutting ellipses from area-minimizing rectangles (Q2250089):

Displaying 23 items.

• Quasi-phi-functions and optimal packing of ellipses (Q288226) (← links)
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Packing ellipsoids by nonlinear optimization (Q312475) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
• Packing ellipsoids into volume-minimizing rectangular boxes (Q506451) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (Q1991149) (← links)
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
• Packing ovals in optimized regular polygons (Q2173521) (← links)
• Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
• A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Packing ellipses in an optimized convex polygon (Q2274890) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Optimized packing clusters of objects in a rectangular container (Q2298400) (← links)
• Optimized ellipse packings in regular polygons (Q2329677) (← links)
• A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
• Rigorous packing of unit squares into a circle (Q2416578) (← links)
• Optimized Object Packings Using Quasi-Phi-Functions (Q4634983) (← links)
• Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
• The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)
• Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations (Q6168498) (← links)