The following pages link to (Q3347319):
Displaying 50 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Performance evaluation of OpenMP-based algorithms for handling Kronecker descriptors (Q433452) (← links)
- Selfish bin packing (Q534779) (← links)
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem (Q705496) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Routing and wavelength assignment in optical networks using bin packing based algorithms (Q856305) (← links)
- Heuristic approaches for batching jobs in printed circuit board assembly (Q868134) (← links)
- A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Class constrained bin covering (Q970104) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- The evolution of a spatial stochastic network (Q981028) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- Scheduling with a minimum number of machines (Q1015305) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
- The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- Anomalous behavior in bin packing algorithms (Q1115351) (← links)
- Mean-variance approach to the management of cyclic deliveries (Q1116874) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- Scheduling jobs on a single machine with periodic release date/deadline intervals (Q1121168) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- A sequential heuristic procedure for one-dimensional cutting (Q1124716) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- Bounds for nested knapsack problems (Q1130040) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
