Pages that link to "Item:Q4051589"
From MaRDI portal
The following pages link to Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589):
Displayed 50 items.
- Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
- Product packing and stacking under uncertainty: a robust approach (Q1740542) (← links)
- The intermediate price of anarchy (IPoA) in bin packing games (Q1744237) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Vehicle minimization for periodic deliveries (Q1771353) (← links)
- More on batched bin packing (Q1785762) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- Bin packing and multiprocessor scheduling problems with side constraint on job types (Q1838290) (← links)
- Algorithms for the variable sized bin packing problem (Q1869719) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- Worst-case analysis of the FFH algorithm for online variable-sized bin packing (Q1909600) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Selfish vector packing (Q1979465) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- From packing rules to cost-sharing mechanisms (Q2082177) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141) (← links)
- Lower bounds for batched bin packing (Q2125232) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- A lower bound for online rectangle packing (Q2331592) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- The tight absolute bound of First Fit in the parameterized case (Q2355708) (← links)
- Online bin packing with \((1,1)\) and \((2,R)\) bins (Q2355985) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Multi-machine energy-aware scheduling (Q2397770) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bin packing problem with scenarios (Q2418155) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663) (← links)