Completing a k-1 assignment

Simple item page
dc.creatorLinusson, Svante
dc.creatorWaestlund, Johan
dc.date2004-10-15
dc.date.accessioned2026-07-07T05:13:18Z
dc.date.available2026-07-07T05:13:18Z
dc.descriptionWe consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost k-1-assignment.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0410347
dc.identifierhttp://arxiv.org/abs/math/0410347
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72894
dc.subjectCombinatorics
dc.subjectProbability
dc.titleCompleting a k-1 assignment
dc.typetext

Files

Collections

arXiv