Stochastic simulations of two-dimensional composite packings
From MaRDI portal
Publication:1372030
DOI10.1006/JCPH.1997.5781zbMATH Open0904.73079OpenAlexW1969070729MaRDI QIDQ1372030FDOQ1372030
Authors: J. Ning
Publication date: 6 November 1997
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.1997.5781
Recommendations
- Simulation of ellipsoidal bodies random packings by mechanical analogy
- Geometric properties of random disk packings.
- A PACKING GENERATION SCHEME FOR THE GRANULAR ASSEMBLIES WITH PLANAR ELLIPTICAL PARTICLES
- A packing algorithm for three-dimensional convex particles
- scientific article; zbMATH DE number 5605692
change of placement areaequilibrium packagesinfluence of external forcestwo-dimensional flexible objectstwo-dimensional rigid objects
Cites Work
- Optimization by simulated annealing
- A theoretical framework for simulated annealing
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Cooling Schedules for Optimal Annealing
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Title not available (Why is that?)
- Algorithm for random close packing of spheres with periodic boundary conditions
- An efficient algorithm for calculating multiparticle thermal interaction in a concentrated dispersion of spheres
- Convergence and finite-time behavior of simulated annealing
- Efficient simulated annealing on fractal energy landscapes
- On the Convergence Rate of Annealing Processes
- Title not available (Why is that?)
- Floorplan design of VLSI circuits
- Title not available (Why is that?)
Cited In (6)
- The convergence of stochastic algorithms solving flow shop scheduling
- The emergence of Airy stress function in two-dimensional disordered packings of particles
- Close-packed structures with finite-range interaction: computational mechanics of layer pair interaction
- Composite nearest-neighbor degeneracies for several kinds of simple particles distributed on two-dimensional, square-cell lattices
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows
Uses Software
This page was built for publication: Stochastic simulations of two-dimensional composite packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372030)