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.
- Bin packing as a random walk: A note on Knödel's paper (Q1084021) (← links)
- The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Edge disjoint Polyp Packing (Q1377661) (← links)
- An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension (Q1391539) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Minimizing the number of stations and station activation costs for a production line (Q1652155) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
- Multidimensional cube packing (Q1762987) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- More on batched bin packing (Q1785762) (← links)
- A linear time algorithm for restricted bin packing and scheduling problems (Q1837623) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- 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)
