Pages that link to "Item:Q3219761"
From MaRDI portal
The following pages link to On a dual version of the one-dimensional bin packing problem (Q3219761):
Displaying 10 items.
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859) (← links)
- The clever shopper problem (Q5919456) (← links)
- Online bin covering with advice (Q5925507) (← links)
- An on-line bin-batching problem. (Q5929317) (← links)
- A note on an open-end bin packing problem (Q5946719) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem (Q6487995) (← links)