Approximate linear programming for networks : average cost bounds
Year of publication: |
2015
|
---|---|
Authors: | Veatch, Michael H. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 63.2015, p. 32-45
|
Subject: | Queueing network | Approximate dynamic programming | Linear programming | Mathematische Optimierung | Mathematical programming | Warteschlangentheorie | Queueing theory |
-
Shone, Rob, (2019)
-
Approximate policy iteration for dynamic resource-constrained project scheduling
Parizi, Mahshid Salemi, (2017)
-
Dynamic capacity allocation for elective surgeries : reducing urgency-weighted wait times
Carew, Stephanie, (2021)
- More ...
-
Fluid analysis of an input control problem
Veatch, Michael H., (2009)
-
Approximate linear programming for average cost MDPs
Veatch, Michael H., (2013)
-
Approximate Linear Programming for Average Cost MDPs
Veatch, Michael H., (2013)
- More ...