Fair integral submodular flows

Integer-valued elements of an integral submodular flow polyhedron Q are investigated which are decreasingly minimal (dec-min) in the sense that their largest component is as small as possible, within this, the second largest component is as small as possible, and so on. As a main result, we prove th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 320; s. 416 - 434
Hlavní autoři: Frank, András, Murota, Kazuo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 30.10.2022
Témata:
Fair optimization
Integral submodular flow
Polyhedral description
Polynomial algorithm
Polyhedral description
Fair optimization
Integral submodular flow
Polynomial algorithm
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Integer-valued elements of an integral submodular flow polyhedron Q are investigated which are decreasingly minimal (dec-min) in the sense that their largest component is as small as possible, within this, the second largest component is as small as possible, and so on. As a main result, we prove that the set of dec-min integral elements of Q is the set of integral elements of another integral submodular flow polyhedron arising from Q by intersecting a face of Q with a box. Based on this description, we develop a strongly polynomial algorithm for computing not only a dec-min integer-valued submodular flow but even a cheapest one with respect to a linear cost-function. A special case is the problem of finding a strongly connected (or k-edge-connected) orientation of a mixed graph whose in-degree vector is decreasingly minimal.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2022.06.015