Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

IPCO
1990

favoriteEmaildiscussreport

76views Optimization» more IPCO 1990»

Probabilistic Analysis of the Generalised Assignment Problem

13 years 5 months ago

Probabilistic Analysis of the Generalised Assignment Problem

Download www.math.cmu.edu

We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved exactly with high probability, in a well-defined sense. The results are closely related to earlier work of Lueker, Goldberg and Marchetti-Spaccamela and ourselves.

Martin E. Dyer, Alan M. Frieze

Real-time Traffic

Assignment Problem | Earlier Work | IPCO 1990 | IPCO 2007 | Well-defined Sense |

claim paper

Related Content

» A probabilistic analysis for the range assignment problem in ad hoc networks

» A Probabilistic Algorithm for kSAT and Constraint Satisfaction Problems

» A general probabilistic model for improving key assignment in wireless networks

» Learning Probabilistic Structure Graphs for Classification and Detection of Object Structu...

» Geometric surrogatebased optimisation for permutationbased problems

» Assignment of Multiplicative Mixtures in Natural Images

» Bayesian Exponential Family PCA

» Delay analysis of a probabilistic priority discipline

» Symmetric range assignment with disjoint MST constraints

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1990
Where	IPCO
Authors	Martin E. Dyer, Alan M. Frieze

Comments (0)