Pages that link to "Item:Q1029696"
From MaRDI portal
The following pages link to Cutting circles and polygons from area-minimizing rectangles (Q1029696):
Displayed 13 items.
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Packing congruent hyperspheres into a hypersphere (Q427402) (← 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)
- 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)
- 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)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Packing circles within ellipses (Q4924059) (← links)