Pages that link to "Item:Q582083"
From MaRDI portal
The following pages link to An on-line algorithm for variable-sized bin packing (Q582083):
Displaying 24 items.
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- Online bin packing with overload cost (Q831684) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← links)
- On-line potato-sack algorithm efficient for packing into small boxes (Q1382412) (← links)
- A bin packing problem with over-sized items (Q1612008) (← links)
- Performance analysis and improvement for some linear on-line bin-packing algorithms (Q1810864) (← links)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing (Q1909600) (← links)
- A bin packing approach to solve the aircraft maintenance task allocation problem (Q2031115) (← links)
- The variable-width strip packing problem (Q2103938) (← links)
- Online bin packing with \((1,1)\) and \((2,R)\) bins (Q2355985) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms (Q2719124) (← links)
- An optimal online algorithm for bounded space variable-sized bin packing (Q2753537) (← links)
- Online Bin Packing with (1,1) and (2,R) Bins (Q2867137) (← links)
- (Q3575450) (← links)
- (Q4439453) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
