The support of bin packing is exponential
From MaRDI portal
Cites work
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
- A robust AFPTAS for online bin packing with polynomial migration
- About the Structure of the Integer Cone and Its Application to Bin Packing
- Aggregating diophantine equations
- Aggregation of equations in integer programming
- An application of simultaneous diophantine approximation in combinatorial optimization
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Carathéodory bounds for integer cones
- Closing the gap for makespan scheduling via sparsification techniques
- Coefficient reduction for inequalities in 0–1 variables
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- New results for aggregating integer-valued equations
- New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
- Optimal constraints aggregation method for ILP
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Reducibility bounds of objective functions over the integers
- Sparse Solutions of Linear Diophantine Equations
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- The support of integer optimal solutions
- The vertices of the knapsack polytope
- Transformation of integer programs to knapsack problems
This page was built for publication: The support of bin packing is exponential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322444)
