Pages that link to "Item:Q2186811"
From MaRDI portal
The following pages link to Online bin packing with cardinality constraints resolved (Q2186811):
Displaying 13 items.
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem (Q3459910) (← links)
- Algorithms – ESA 2005 (Q5475869) (← links)
- A new lower bound for classic online bin packing (Q5918310) (← links)
- Several methods of analysis for cardinality constrained bin packing (Q5918534) (← links)
- Several methods of analysis for cardinality constrained bin packing (Q5970788) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- Online cardinality constrained scheduling (Q6556169) (← links)