Pages that link to "Item:Q1887860"
From MaRDI portal
The following pages link to Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860):
Displaying 46 items.
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- Modeling close packing of 3D objects (Q315021) (← 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)
- High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- Damped Arrow-Hurwicz algorithm for sphere packing (Q680083) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← 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)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Maximizing the sum of radii of balls inscribed in a polyhedral set (Q2272896) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) (← 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)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
- A new upper bound for the cylinder packing problem (Q2767745) (← links)
- Recursive circle packing problems (Q2803272) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- Packing identical spheres into a cylinder (Q3002688) (← links)
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
- Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- Optimized Object Packings Using Quasi-Phi-Functions (Q4634983) (← links)
- Packing circles within ellipses (Q4924059) (← links)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
- An efficient method for the three-dimensional container loading problem by forming box sizes (Q6048170) (← links)