Supermodularity in unweighted graph optimization III : highly connected digraphs
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. 763-780
|
Subject: | degree-sequences | k-connected digraphs | connectivity augmentation | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Hosseinian, Seyedmohammadhossein, (2020)
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
- More ...
-
Supermodularity in unweighted graph optimization I : branchings and matchings
Bérczi, Kristóf, (2018)
-
Supermodularity in unweighted graph optimization II : matroidal term rank augmentation
Bérczi, Kristóf, (2018)
-
Approximations for many-visits multiple traveling salesman problems
Bérczi, Kristóf, (2023)
- More ...