A min-max theorem for the minimum fleet-size problem
Year of publication: |
2023
|
---|---|
Authors: | Ye, Tinghan ; Shmoys, David Bernard |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 3, p. 312-314
|
Subject: | Minimum fleet-size problem | Min-max theorem | Bipartite matching | Theorie | Theory | Matching | Mathematische Optimierung | Mathematical programming |
-
The nonnegative node weight j-restricted k-matching problems
Li, Yanjun, (2014)
-
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches
Homsi, Gabriel, (2021)
-
An approximate dynamic programming approach to dynamic stochastic matching
You, Fan, (2024)
- More ...
-
Modeling the risk of in-person instruction during the COVID-19 pandemic
Liu, Brian, (2024)
-
Mathematical programming guides air-ambulance routing at Ornge
Carnes, Timothy A., (2013)
-
Assortment optimization under the multinomial logit model with random choice parameters
Rusmevichientong, Paat, (2014)
- More ...