The complexity of computing the random priority allocation matrix
Year of publication: |
2015
|
---|---|
Authors: | Saban, Daniela ; Sethuraman, Jay |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 4, p. 1005-1014
|
Subject: | networks | graphs | randomized algorithms | random priority | assignment | matching | complexity | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Allokation | Allocation |
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain, (2015)
-
Computing optimal shortcuts for networks
Garijo, Delia, (2019)
-
Stable project allocation under distributional constraints
Ágoston, Kolos Csaba, (2018)
- More ...
-
A note on object allocation under lexicographic preferences
Saban, Daniela, (2014)
-
Convergence of the core in assignment markets
Kanoria, Yash, (2018)
-
A note on object allocation under lexicographic preferences
Saban, Daniela, (2014)
- More ...