On the probabilistic analysis of a decentralized version of one generalization of the assignment problem

MaRDI QIDQ3115263zbMATH OpenFDO

Authors Eh. Kh. Gimadi, V. T. Dement'ev

Publication date 20 February 2012

zbMATH Keywords

uniform distributionapproximation algorithmNP-hardnessasymptotic optimalitydecentralized transportation problemPetrov's theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• An analysis of a decomposition heuristic for the assignment problem
• The Probabilistic Analysis of a Heuristic for the Assignment Problem
• Probabilistic analysis of the generalised assignment problem
• A probabilistic feasibility and value analysis of the generalized assignment problem
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem

Cited in

(2)

• An analysis of a decomposition heuristic for the assignment problem
• Probabilistic analysis of the generalised assignment problem

This page was built for publication: On the probabilistic analysis of a decentralized version of one generalization of the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115263)