scientific article; zbMATH DE number 52589
From MaRDI portal
Publication:4002885
Recommendations
Cited in
(51)- The ratio of the extreme to the sum in a random sequence
- Heuristics and exact methods for number partitioning
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- A note on packing random intervals with varying density
- A tight upper bound for the \(k\)-partition problem on ideal sets
- Multidimensional on-line bin-packing: An algorithm and its average-case analysis
- Optimal packing of similar triangles
- Occupancy urn models in the analysis of algorithms
- Stochastic simulations of two-dimensional composite packings
- Partitioning under the \(L_p\) norm
- Extending Graham's result on scheduling to other heuristics
- Expected wasted space of optimal simple rectangle packing
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- Order of decay of the wasted space for a stochastic packing problem.
- Assigning service requests in voice-over-internet gateway multiprocessors
- Bin-packing and matchings in threshold graphs
- The modified differencing method for the set partitioning problem with cardinality constraints
- Probabilistic analysis of a bin covering algorithm
- Pattern minimisation in cutting stock problems
- Best fit bin packing with random order revisited
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
- A new model for the linear 1-dimensional online clustering problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Probabilistic quality estimations for combinatorial optimization problems
- Average case analysis of bounded space bin packing algorithms
- Packing rectangles and intervals∗
- Probabilistic analysis of algorithms for dual bin packing problems
- Proof of the local REM conjecture for number partitioning. I: Constant energy scales
- Probabilistic analysis of optimum partitioning
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- scientific article; zbMATH DE number 4049028 (Why is no real title available?)
- Inequalities for bin packing-III
- scientific article; zbMATH DE number 176070 (Why is no real title available?)
- Probabilistic analysis of the number partitioning problem
- Partitioning ideal sets
- scientific article; zbMATH DE number 1340282 (Why is no real title available?)
- Stochastic analysis of partitioning algorithms for matching problems
- A probabilistic analysis of a fixed partition policy for the inventory-routing problem
- Hoeffding's Inequality for Stopped Martingales and Semi-Markov Processes
- Best fit bin packing with random order revisited
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- Average-case analysis of cutting and packing in two dimensions
- Packing random intervals
- Approximation of some NP-hard optimization problems by finite machines, in probability
- A physicist's approach to number partitioning
- Algorithmic obstructions in the random number partitioning problem
- Partially ordered sets corresponding to the partition problem
- Competitive ratio vs regret minimization: achieving the best of both worlds
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
- Random-order bin packing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002885)
