The following pages link to Fast algorithms for bin packing (Q1845315):
Displaying 50 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Best \(k\)-fit bin packing (Q685862) (← links)
- An on-line algorithm for multidimensional bin packing (Q688930) (← links)
- A storage-size selection problem (Q795502) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- Convergence of optimal stochastic bin packing (Q1062627) (← links)
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- ``A posteriori'' evaluation of bin packing approximation algorithms (Q1139943) (← links)
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248) (← links)
- A class of simple stochastic online bin packing algorithms (Q1161297) (← links)
- A modular algorithm for an extended vehicle scheduling problem (Q1162919) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- Design of private backbone networks. II: Time varying grouped traffic (Q1261334) (← links)
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373) (← links)
- A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- Heuristics for laying out information graphs (Q1332692) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Optimal energy-efficient placement of virtual machines with divisible sizes (Q1653041) (← links)
- A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts (Q1708260) (← links)
- More on batched bin packing (Q1785762) (← links)
