A powerful bin packing problem solver for any polygons
-
Updated
May 21, 2026 - Python
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
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.
Add a description, image, and links to the packing-problem topic page so that developers can more easily learn about it.
To associate your repository with the packing-problem topic, visit your repo's landing page and select "manage topics."