Directed submodularity, ditroids and directed submodular flows

Set relations and operations such as inclusion, union and intersection are generalized to directed subsets whose elements are distinguished between forward and backward elements. The concepts of submodular functions, matroids and polymatroidal network flows are extended to the concepts of directed submodular functions, ditroids and directed submodular flows on directed subsets. Two unrelated matroids (submodular functions) can be embedded in one ditroid (directed submodular function). Total dual integrality is preserved in these generalizations and proved for very general set-function class-directed odd submodular functions.

[1]  Liqun Qi.  Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions , 1988, Math. Oper. Res..

[2]  William J. Cook,et al.  On box totally dual integral polyhedra , 1986, Math. Program..

[3]  Alexander Schrijver,et al.  Min-Max Results in Combinatorial Optimization , 1982, ISMP.

[4]  Refael Hassin,et al.  Minimum cost flow with set-constraints , 1982, Networks.

[5]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[6]  Michel Las Vergnas,et al.  Orientability of matroids , 1978, J. Comb. Theory B.

[7]  Satoru Fujishige.  Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions , 1984, Math. Program..

[8]  Satoru Fujishige.  A system of linear inequalities with a submodular function on {0,±1}; vectors☆ , 1984 .

[9]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

[10]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[11]  András Frank,et al.  A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..

[12]  Satoru Fujishige.  Canonical decompositions of symmetric submodular systems , 1983, Discret. Appl. Math..

[13]  András Frank,et al.  Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.

[14]  L. Wolsey.  Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..

[15]  Michel Las Vergnas,et al.  Convexity in oriented matroids , 1980, J. Comb. Theory B.

[16]  U. Zimmermann.  Minimization of Some Nonlinear Functions over Polymatroidal Network Flows , 1982 .

[17]  Jack Edmonds,et al.  Total Dual Integrality of Linear Inequality Systems , 1984 .

[18]  U. Zimmermann.  Minimization of Combined Objective Functions on Integral Submodular Flows , 1984 .

[19]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[20]  A. Frank.  An Algorithm for Submodular Functions on Graphs , 1982 .

[21]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[22]  William H. Cunningham,et al.  A submodular network simplex method , 1984 .

[23]  Robert G. Bland,et al.  A combinatorial abstraction of linear programming , 1977, J. Comb. Theory B.

[24]  Satoru Fujishige,et al.  Structures of polyhedra determined by submodular functions on crossing families , 1984, Math. Program..

[25]  B. Korte,et al.  Greedoids - A Structural Framework for the Greedy Algorithm , 1984 .

[26]  S. Fujishige.  Submodular systems and related topics , 1984 .

[27]  Satoru Fujishige,et al.  On the subdifferential of a submodular function , 1984, Math. Program..

[28]  U. ZIMMERMANN,et al.  Minimization on submodular flows , 1982, Discret. Appl. Math..

[29]  E. L. Lawler,et al.  Flow Network Formulations of Polymatroid Optimization Problems , 1982 .

[30]  A. Schrijver.  Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .