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):
Displayed 50 items.
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (Q2043801) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- From packing rules to cost-sharing mechanisms (Q2082177) (← links)
- Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- A bi-criteria optimization model for medical device sterilization (Q2212292) (← links)
- On bin packing with clustering and bin packing with delays (Q2234744) (← links)
- Constructive heuristics for the canister filling problem (Q2276059) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Scheduling with an orthogonal resource constraint (Q2350899) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- 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)