The following pages link to Attila Benko (Q301137):
Displaying 6 items.
- Bin covering with a general profit function: approximability results (Q301139) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- (Q2859441) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)