Pages that link to "Item:Q1029696"

The following pages link to Cutting circles and polygons from area-minimizing rectangles (Q1029696):

Displaying 38 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)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← 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)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Packing congruent hyperspheres into a hypersphere (Q427402) (← links)
• Packing ellipsoids into volume-minimizing rectangular boxes (Q506451) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• A review of recent advances in global optimization (Q842710) (← 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)
• Minimal surface convex hulls of spheres (Q1633782) (← links)
• Does any convex quadrilateral have circumscribed ellipses? (Q1698466) (← links)
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation (Q1754302) (← links)
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
• Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
• A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
• Optimal clustering of a pair of irregular objects (Q2018508) (← links)
• Sparsest balanced packing of irregular 3D objects in a cylindrical container (Q2029950) (← links)
• A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
• Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Irregular packing problems: a review of mathematical models (Q2286866) (← links)
• Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
• Optimized packing clusters of objects in a rectangular container (Q2298400) (← 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 circles into perimeter-minimizing convex hulls (Q2423783) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Recursive circle packing problems (Q2803272) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)
• Packing circles within ellipses (Q4924059) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)