Pages that link to "Item:Q2429476"
From MaRDI portal
The following pages link to Bin packing with general cost structures (Q2429476):
Displaying 13 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Online bin packing with overload cost (Q831684) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
- Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
