Pages that link to "Item:Q385496"
From MaRDI portal
The following pages link to Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496):
Displaying 13 items.
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- Quasi-human seniority-order algorithm for unequal circles packing (Q528450) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts (Q1708260) (← links)
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Comparing the costs of any fit algorithms for bin packing (Q2102827) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- On online bin packing with LIB constraints (Q3655570) (← links)
- (Q4723300) (← links)
- Bin packing with directed stackability conflicts (Q5501519) (← links)
