Pages that link to "Item:Q5438528"
From MaRDI portal
The following pages link to Bin‐packing problem with concave costs of bin utilization (Q5438528):
Displaying 10 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Online bin packing with overload cost (Q831684) (← links)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← 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)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- Optimal Partitioning Which Maximizes the Weighted Sum of Products (Q4632209) (← links)
- Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
