The following pages link to (Q3840364):
Displaying 17 items.
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Online square packing with gravity (Q476449) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- Efficient algorithms for orthogonal packing problems (Q5413218) (← links)
- A new lower bound for classic online bin packing (Q5918895) (← links)
- New heuristics for one-dimensional bin-packing (Q5959374) (← links)
