Pages that link to "Item:Q2933654"
From MaRDI portal
The following pages link to Bin Packing via Discrepancy of Permutations (Q2933654):
Displaying 16 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Random-order bin packing (Q948706) (← links)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bounds for the Nakamura number (Q2417421) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- On the Combinatorics of Placing Balls into Ordered Bins (Q4958964) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
- (Q5365057) (redirect page) (← links)
- Discrepancy theory and related algorithms (Q6200209) (← links)