Cutting ellipses from area-minimizing rectangles
From MaRDI portal
Publication:2250089
DOI10.1007/s10898-013-0125-3zbMath1301.90073OpenAlexW1974255097MaRDI QIDQ2250089
Josef Kallrath, Steffen Rebennack
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0125-3
global optimizationmixed integer programmingpacking problemcomputational geometrycutting stock problemshape constraintsdesign problemnon-convex nonlinear programmingnon-overlap constraintspolylithic solution approach
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Related Items
Quasi-phi-functions and optimal packing of ellipses, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Packing ellipsoids by nonlinear optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, A nonlinear programming model with implicit variables for packing ellipsoids, Packing ovals in optimized regular polygons, Packing ellipsoids in an optimized cylinder, Rigorous packing of unit squares into a circle, The concept of modeling packing and covering problems using modern computational geometry software, Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations, Decomposition Algorithm for Irregular Placement Problems, Optimized Object Packings Using Quasi-Phi-Functions, Packing ellipsoids into volume-minimizing rectangular boxes, A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids, A fully general, exact algorithm for nesting irregular shapes, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Packing ellipses in an optimized convex polygon, QPLIB: a library of quadratic programming instances, Optimized packing clusters of objects in a rectangular container, Optimized ellipse packings in regular polygons, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
Uses Software
Cites Work
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Polylithic modeling and solution approaches using algebraic modeling systems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Semi-infinite programming
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Reformulation and convex relaxation techniques for global optimization
- Greedy randomized adaptive search procedures
- A typology of cutting and packing problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
