Pages that link to "Item:Q4051589"
From MaRDI portal
The following pages link to Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589):
Displayed 37 items.
- Vehicle minimization for periodic deliveries (Q1771353) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- Bin packing and multiprocessor scheduling problems with side constraint on job types (Q1838290) (← links)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing (Q1909600) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- Scheduling advertisements on a web page to maximize revenue (Q2497296) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Online square and cube packing (Q2570973) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Parametric Lower Bound for On-Line Bin-Packing (Q3724089) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- On Packing Two-Dimensional Bins (Q3958477) (← links)
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing (Q3960135) (← links)
- A Counterexample to a Bin Packing Conjecture (Q3963029) (← links)
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
- (Q4487093) (← links)
- Linear waste of best fit bin packing on skewed distributions (Q4537630) (← links)
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- (Q4852904) (← links)
- List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan (Q5292944) (← links)
- Analysis of Stochastic Online Bin Packing Processes (Q5462796) (← links)
- Approximation algorithms for the design of SDH/SONET networks (Q5479829) (← links)
- Online algorithms for page replication in rings (Q5958716) (← links)
- On the Bahncard problem (Q5958720) (← links)