Pages that link to "Item:Q1164429"
From MaRDI portal
The following pages link to Bin packing can be solved within 1+epsilon in linear time (Q1164429):
Displaying 50 items.
- Offline black and white bin packing (Q2355707) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- Batched bin packing revisited (Q2398649) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Windows scheduling of arbitrary-length jobs on multiple machines (Q2434274) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- Bin covering with cardinality constraints (Q2446840) (← links)
- Note on non-uniform bin packing games (Q2448901) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- A note on the approximability of cutting stock problems (Q2643962) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Online two-dimensional vector packing with advice (Q2692736) (← links)
- Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Scheduling with Interjob Communication on Parallel Processors (Q2958346) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY (Q3503009) (← links)
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP (Q3541790) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- An efficient heuristic method for the simple assembly line balancing problem (Q3707758) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- (Q4852904) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- A new and improved algorithm for online bin packing (Q5009562) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- (Q5091067) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Minimum Weighted Sum Bin Packing (Q5443385) (← links)
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints (Q5443386) (← links)
- (Q5743405) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Several methods of analysis for cardinality constrained bin packing (Q5918534) (← links)