The following pages link to (Q4002885):
Displaying 45 items.
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem (Q705496) (← links)
- Random-order bin packing (Q948706) (← links)
- The ratio of the extreme to the sum in a random sequence (Q1003314) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- A note on packing random intervals with varying density (Q1273009) (← links)
- A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356) (← links)
- Multidimensional on-line bin-packing: An algorithm and its average-case analysis (Q1313752) (← links)
- Optimal packing of similar triangles (Q1345878) (← links)
- Occupancy urn models in the analysis of algorithms (Q1347968) (← links)
- Stochastic simulations of two-dimensional composite packings (Q1372030) (← links)
- Partitioning under the \(L_p\) norm (Q1572977) (← links)
- Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
- Expected wasted space of optimal simple rectangle packing (Q1769075) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- Order of decay of the wasted space for a stochastic packing problem. (Q1884829) (← links)
- Assigning service requests in voice-over-internet gateway multiprocessors (Q1886507) (← links)
- Bin-packing and matchings in threshold graphs (Q1900150) (← links)
- The modified differencing method for the set partitioning problem with cardinality constraints (Q1902901) (← links)
- Probabilistic analysis of a bin covering algorithm (Q1919189) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem (Q2125915) (← links)
- A new model for the linear 1-dimensional online clustering problem (Q2254541) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Probabilistic quality estimations for combinatorial optimization problems (Q2413265) (← links)
- Average case analysis of bounded space bin packing algorithms (Q2471807) (← links)
- Packing rectangles and intervals<sup>∗</sup> (Q2720127) (← links)
- Probabilistic analysis of algorithms for dual bin packing problems (Q3361889) (← links)
- Proof of the local REM conjecture for number partitioning. I: Constant energy scales (Q3619613) (← links)
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics (Q3779988) (← links)
- Inequalities for bin packing-III (Q3835618) (← links)
- Probabilistic analysis of the number partitioning problem (Q4254273) (← links)
- Partitioning ideal sets (Q4254655) (← links)
- Some exact rates for the random weighted interval packing problem (Q4265787) (← links)
- Stochastic analysis of partitioning algorithms for matching problems (Q4519111) (← links)
- A probabilistic analysis of a fixed partition policy for the inventory-routing problem (Q4651724) (← links)
- Hoeffding's Inequality for Stopped Martingales and Semi-Markov Processes (Q4678847) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- (Q5691080) (← links)
- Packing random intervals (Q5916378) (← links)
- Approximation of some NP-hard optimization problems by finite machines, in probability (Q5941283) (← links)
- A physicist's approach to number partitioning (Q5958802) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
