Complexity of Source-Sink Monotone 2-parameter min cut
Year of publication: |
2022
|
---|---|
Authors: | Allman, Maxwell ; Lo, Venus ; McCormick, S. Thomas |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 1, p. 84-90
|
Subject: | Max Flow/Min Cut | Network flow | Parametric flow | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Parametric computation of minimum-cost flows with piecewise quadratic costs
Klimm, Max, (2022)
-
Solving the single-sink, fixed-charge, multiple-choice transportation problem by dynamic programming
Christensen, Tue R. L., (2013)
-
Optimization-based adaptive large neighborhood search for the production routing problem
Adulyasak, Yossiri, (2014)
- More ...
-
On rank dominance of tie-breaking rules
Allman, Maxwell, (2023)
-
Omnichannel assortment optimization under the multinomial logit model with a features tree
Lo, Venus, (2022)
-
Assortment optimization under the multinomial logit model with product synergies
Lo, Venus, (2019)
- More ...