No label defined (Q3330974)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3862931
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3862931

      Statements

      1984
      0 references
      directed graph
      0 references
      survey
      0 references
      combinatorial optimization
      0 references
      submodular function
      0 references
      total dual integrality
      0 references
      systems of linear inequalities
      0 references
      directed graphs
      0 references
      crossing families
      0 references
      supermodular functions
      0 references
      matching and covering theorems
      0 references
      max-flow min-cut theorem
      0 references
      trees
      0 references
      optimum branching
      0 references
      matroids
      0 references
      [For the entire collection see Zbl 0535.00030.] This paper surveys old and new results asserting the total dual integrality of certain systems of linear inequalities, involving directed graphs, crossing families, and sub- and supermodular functions. The basis is a proof technique set up by Edmonds, Giles, Hoffman, Johnson, Lovász and Robertson of first showing that the active constraints in the optimum of the linear program can be chosen to be ''nice'' (e.g. ''cross-free'' or ''laminar''), and next that nice constraint sets are unimodular. This implies that the linear programs have integer optimum solutions. The results discussed are König's matching and covering theorems, Menger's theorem, Ford-Fulkerson's max-flow min-cut theorem, Dilworth's decomposition theorem for partially ordered sets, theorems on shortest paths, common SDR's and trees, Fulkerson's optimum branching theorem, the Lucchesi-Younger theorem, Nash-Williams' orientation theorem, Edmond's theorems on (poly)matroids and their intersection, extensions of these theorems to submodular flows by Edmonds, Giles, Frank, Tardos, Hoffman's theory of lattice polyhedra, Grishuhin's model, König's edge-colouring theorem, the Hoffman-Schwartz chain model, Edmonds' branching packing theorem, and results by the author on crossing families, strong connectors and supermodular colourings. A study is made of the interrelations between these results.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references