packing-problem

A powerful bin packing problem solver for any polygons

A solver for (geometrical) packing problems

A 3D adaptation of the state-of-the-art sparrow nesting algorithm

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.

Pack 15 unit semicircles into the smallest enclosing circle

6,071 new best-known packings of equal circles, spheres and hyperspheres (Packomania, 21 tables: triangle, quadrant, semicircle, rectangles, square, 5-, 6-, 15- and 16-gon, spheres in a cube and a sphere, balls in 4-6 D), each verified by two independent exact checkers; 1,340 certified locally optimal. By Moki&Julio.

Skrypt python służący do wizualizacji i rozwiązywania problemu plecakowego, wykorzystująca matplotlib, numpy oraz pandas do analizy i graficznego przedstawienia optymalnych kombinacji wag i wartości przedmiotów. Idealny do wizualizacji problemu co ułatwi jego zrozumienie oraz naukę.

Browser-based structural diagnostic tool for finite-dimensional complex Grassmannian line packings. Computes five-kernel coherence, Welch slack, saturated graph, cliff, worst d-tuple morphology, frame tightness, Bargmann phases, and side-by-side comparison against the Game of Sloanes leaderboard. Runs entirely in the browser.

An optimization tool developed at the University of Michigan to assist travelers in maximizing the value of items they pack. Utilizing algorithms, this Java-based solution determines the best combination of items to include in a limited luggage space, ensuring you never leave behind what's important.

because Malevich-lib only does squares