Skip to content

Fix #95: Add BinPacking model #96

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
GiggleLiu wants to merge 6 commits into
base: main
Choose a base branch
from
Open

Fix #95: Add BinPacking model #96

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
abb24c6
Add plan for #95: BinPacking model
GiggleLiu Feb 25, 2026
b6bc116
feat: add BinPacking model (optimization, minimize bins)
GiggleLiu Feb 25, 2026
7a3a180
test: add BinPacking unit tests
GiggleLiu Feb 25, 2026
a4040e1
feat: register BinPacking in CLI dispatch
GiggleLiu Feb 25, 2026
544c967
docs: add BinPacking problem definition to paper
GiggleLiu Feb 25, 2026
252eee8
update
GiggleLiu Feb 25, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions docs/paper/reductions.typ
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -49,6 +49,7 @@
"BMF": [Boolean Matrix Factorization],
"PaintShop": [Paint Shop],
"BicliqueCover": [Biclique Cover],
"BinPacking": [Bin Packing],
)

// Definition label: "def:<ProblemName>" — each definition block must have a matching label
Expand Down Expand Up @@ -400,6 +401,10 @@ In all graph problems below, $G = (V, E)$ denotes an undirected graph with $|V|
Given a bipartite graph $G = (L, R, E)$ and integer $k$, find $k$ bicliques $(L_1, R_1), dots, (L_k, R_k)$ that cover all edges ($E subset.eq union.big_i L_i times R_i$) while minimizing the total size $sum_i (|L_i| + |R_i|)$.
]

#problem-def("BinPacking")[
Given $n$ items with sizes $s_1, dots, s_n in RR^+$ and bin capacity $C > 0$, find an assignment $x: {1, dots, n} -> {1, dots, n}$ minimizing $|{x(i) : i = 1, dots, n}|$ (number of distinct bins used) subject to $forall j: sum_(i: x(i) = j) s_i lt.eq C$.
]

// Completeness check: warn about problem types in JSON but missing from paper
#{
let json-models = {
Expand Down
Loading