Pages that link to "Item:Q1870019"
From MaRDI portal
The following pages link to Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019):
Displaying 5 items.
- Polyhedral circuits and their applications (Q2039640) (← links)
- A discrete Farkas lemma (Q2386214) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
