Pages that link to "Item:Q606170"
From MaRDI portal
The following pages link to A literature review on circle and sphere packing problems: models and methodologies (Q606170):
Displaying 50 items.
- Modeling close packing of 3D objects (Q315021) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← 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)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Packing unequal spheres into various containers (Q334249) (← links)
- High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
- Packing congruent hyperspheres into a hypersphere (Q427402) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Damped Arrow-Hurwicz algorithm for sphere packing (Q680083) (← links)
- Optimal packing of material flow on conveyor belts (Q724337) (← links)
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) (← links)
- Minimal surface convex hulls of spheres (Q1633782) (← links)
- A local search-based method for sphere packing problems (Q1634289) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- Configuration space of geometric objects (Q1711377) (← links)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study (Q1749785) (← links)
- An optimal classification method for biological and medical data (Q1954742) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
- Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm (Q2141175) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Maximizing the sum of radii of balls inscribed in a polyhedral set (Q2272896) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- Optimized ellipse packings in regular polygons (Q2329677) (← links)
- Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Online circle and sphere packing (Q2419121) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- Packing disks into disks with optimal worst-case density (Q2679596) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
- Recursive circle packing problems (Q2803272) (← links)
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain (Q2940410) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
- Optimized Object Packings Using Quasi-Phi-Functions (Q4634983) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Packing congruent spheres into a multi‐connected polyhedral domain (Q4921255) (← links)
- (Q5088965) (← links)
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)
