{"id":15065746,"url":"https://github.com/bennynil/simplebinpackingsolver","last_synced_at":"2026-02-13T16:31:38.803Z","repository":{"id":255243007,"uuid":"848480809","full_name":"bennynil/SImpleBinPackingSolver","owner":"bennynil","description":"use first fit, branch and bound, random best fit to solve bin packing problem","archived":false,"fork":false,"pushed_at":"2024-09-15T08:06:44.000Z","size":98350,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-16T00:18:15.719Z","etag":null,"topics":["binpacking","branch-and-bound","first-fit-decreasing","guillotine-cut","unity3d"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bennynil.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-27T20:53:15.000Z","updated_at":"2024-09-15T08:06:48.000Z","dependencies_parsed_at":null,"dependency_job_id":"eb6e1bbe-afb4-4d7c-ac22-69b7779d38b0","html_url":"https://github.com/bennynil/SImpleBinPackingSolver","commit_stats":null,"previous_names":["bennynil/simplebinpackingsolver"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bennynil%2FSImpleBinPackingSolver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bennynil%2FSImpleBinPackingSolver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bennynil%2FSImpleBinPackingSolver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bennynil%2FSImpleBinPackingSolver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bennynil","download_url":"https://codeload.github.com/bennynil/SImpleBinPackingSolver/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243806389,"owners_count":20350832,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binpacking","branch-and-bound","first-fit-decreasing","guillotine-cut","unity3d"],"created_at":"2024-09-25T00:47:07.075Z","updated_at":"2026-02-13T16:31:38.770Z","avatar_url":"https://github.com/bennynil.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# binPackingSolver\nHow This Works:\nSort the Boxes:  \n  Arrange the boxes in non-decreasing order of their size.  \nApply First Fit Algorithm:  \n  Use the First Fit heuristic to place each box into the bin where it fits.\n  This heuristic quickly generates an initial feasible packing solution by trying to minimize wasted space in each bin.  \n\nRefine with Branch and Bound:\n  Improve the solution from Step 2 by employing a Branch and Bound method that explores different boxes the box fit in.\n  This step aims to optimize the packing further by considering various choices of the boxes being cut.\nAdditional Features:\n  Cutting Stock Problem: The program can also be adapted to solve cutting stock problems.\nRandom Fit Option:   \n  Multiple solvers can run concurrently with random box orders to explore different potential solutions and find the best one.\nLimitations:   \n  The program can only handle box placements and does not support spherical objects. The quality of the result is assessed based on space utilization rather than the value of the items.  \napp can be found in app folder, use the exe file in it.  \ntest file in folder cutboxtest.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbennynil%2Fsimplebinpackingsolver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbennynil%2Fsimplebinpackingsolver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbennynil%2Fsimplebinpackingsolver/lists"}