A powerful bin packing problem solver for any polygons
-
Updated
May 21, 2026 - Python
A powerful bin packing problem solver for any polygons
Simulated Annealing with Modern Fortran
About fuzzy logic using the Maxwell's pendulum
A Python framework implementing Basin Hopping Monte Carlo algorithm coupled with VASP for studying ion insertion in materials.
Python circle-packing solvers from self-improving AI agents, with Packomania benchmarks and independent verification. Sequential linear programming, SLSQP and basin hopping maximize summed radii in a unit square.
CHE 622 PROJECT
Perlin-noise proposals for molecular structure search, tested against a correlation-matched Gaussian null model: code, all results and DFT inputs
Optimizer for packing n equal circles of maximal radius in convex containers (square, rectangles, polygons, circle, quadrant, semicircle, ...). Soft-to-rigid penalty phase, basin hopping, dense SLSQP and sparse LP (HiGHS) polish, parallel multi-start, and an exact rational verifier. Packomania-compatible.
GP-guided cluster structure optimizer for all 103 elements — basin-hopping, parallel tempering, MACE-MP-0 ML potential, full GUI
To associate your repository with the basin-hopping topic, visit your repo's landing page and select "manage topics."