Pages that link to "Item:Q3750704"
From MaRDI portal
The following pages link to Probabilistic analysis of optimum partitioning (Q3750704):
Displayed 14 items.
- On the height of digital trees and related problems (Q922689) (← links)
- Heuristics and exact methods for number partitioning (Q1038378) (← links)
- A note on the average-case behavior of a simple differencing method for partitioning (Q1095035) (← links)
- A complete anytime algorithm for number partitioning (Q1277696) (← links)
- Two-dimensional packing algorithms for layout of disconnected graphs (Q1857089) (← links)
- Easily searched encodings for number partitioning (Q1918002) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Gaussian discrepancy: a probabilistic relaxation of vector balancing (Q2081474) (← links)
- Randomized methods for the number partitioning problem (Q2563882) (← links)
- (Q3349963) (← links)
- The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples (Q3465589) (← links)
- Phase Transition in the Number Partitioning Problem (Q4492521) (← links)
- A physicist's approach to number partitioning (Q5958802) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)