Pages that link to "Item:Q1919179"
From MaRDI portal
The following pages link to A tight lower bound for optimal bin packing (Q1919179):
Displaying 28 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- Almost optimal solutions for bin coloring problems (Q941831) (← links)
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← 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)
- An improved lower bound for the bin packing problem (Q1917305) (← 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)
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
- On a generalized bin-packing problem (Q3328283) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- Some inequalities for bin packing (Q3833329) (← links)
- (Q4351085) (← links)
- (Q4605573) (← links)
- (Q4723300) (← links)
- Algorithms and Computation (Q5897842) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)
