Pages that link to "Item:Q932199"
From MaRDI portal
The following pages link to Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199):
Displaying 50 items.
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- The disruptive anti-covering location problem (Q320083) (← 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)
- Differential evolution methods based on local searches (Q336908) (← links)
- Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- On the unboundedness of facility layout problems (Q604804) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Efficiently packing unequal disks in a circle (Q924882) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- Survey of quantitative methods in construction (Q1651605) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← 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)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- One-dimensional nested maximin designs (Q2269596) (← links)
- Maximizing the sum of radii of balls inscribed in a polyhedral set (Q2272896) (← 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)
- Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) (← 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)
- Development and calibration of a currency trading strategy using global optimization (Q2392749) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- Evolutionary computation solutions to the circle packing problem (Q2402110) (← links)
- Rigorous packing of unit squares into a circle (Q2416578) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
- Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
- Packing disks into disks with optimal worst-case density (Q2679596) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
