ISSN:
1436-4646
Keywords:
Random linear program
;
probabilistic analysis of algorithms
;
average complexity
;
quadratic assignment problem
;
branch-and-bound
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We consider linear programs in which the objective function (cost) coefficients are independent non-negative random variables, and give upper bounds for the random minimum cost. One application shows that for quadratic assignment problems with such costs certain branch-and-bound algorithms usually take more than exponential time.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01589437
Permalink