Approximating the first-come, first-served stochastic matching model with Ohm’s Law
Year of publication: |
September-October 2018
|
---|---|
Authors: | Fazel-Zarandi, Mohammad M. ; Kaplan, Edward H. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 66.2018, 5, p. 1423-1432
|
Subject: | service system | first-come, first-served policy | bipartite graph | multitype customers and servers | matching rates | Ohm’s Law | Graphentheorie | Graph theory | Operations Research | Operations research | USA | United States | Theorie | Theory |
-
Uniform concurrent multicommodity flow in product graphs
Shahrokhi, Farhad, (1992)
-
Steiner tree packing revisited
Hoàng, Nam Dũng, (2012)
-
Maximum number of colors in hypertrees of bounded degree
Bujtás, Csilla, (2015)
- More ...
-
Fazel-Zarandi, Mohammad M., (2012)
-
Can firms benefit from competition?
Fazel-Zarandi, Mohammad M., (2021)
-
Almost robust discrete optimization
Baron, Opher, (2019)
- More ...