Supermodularity in unweighted graph optimization I : branchings and matchings
Year of publication: |
August 2018
|
---|---|
Authors: | Bérczi, Kristóf ; Frank, András |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 43.2018, 3, p. 726-753
|
Subject: | supermodular arc-covering | packing branchings | term rank | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Ranking-Verfahren | Ranking method |
-
Supermodularity in unweighted graph optimization II : matroidal term rank augmentation
Bérczi, Kristóf, (2018)
-
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Benchetrit, Yohann, (2018)
-
Verma, Tina, (2022)
- More ...
-
Supermodularity in unweighted graph optimization II : matroidal term rank augmentation
Bérczi, Kristóf, (2018)
-
Supermodularity in unweighted graph optimization III : highly connected digraphs
Bérczi, Kristóf, (2018)
-
Approximations for many-visits multiple traveling salesman problems
Bérczi, Kristóf, (2023)
- More ...