Pages that link to "Item:Q933537"
From MaRDI portal
The following pages link to An asymptotic approximation scheme for the concave cost bin packing problem (Q933537):
Displaying 12 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- (Q3720294) (← links)
- Optimal Partitioning Which Maximizes the Weighted Sum of Products (Q4632209) (← links)
- Bin‐packing problem with concave costs of bin utilization (Q5438528) (← 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)
