scientific article

zbMath0542.90068MaRDI QIDQ3330974

No author found.

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveycombinatorial optimizationsubmodular functiondirected graphmatroidstreessupermodular functionsdirected graphssystems of linear inequalitiesmax-flow min-cut theoremtotal dual integralityoptimum branchingcrossing familiesmatching and covering theorems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (28)

K-submodular functions and convexity of their Lovász extension ⋮ On box totally dual integral polyhedra ⋮ Optimum partitioning into intersections of ring families ⋮ Switchdec polyhedra ⋮ Generalized polymatroids and submodular flows ⋮ Directed submodularity, ditroids and directed submodular flows ⋮ Lattice polyhedra and submodular flows ⋮ Characterizing and recognizing generalized polymatroids ⋮ The \(b\)-branching problem in digraphs ⋮ An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint ⋮ Unnamed Item ⋮ On the orientation of graphs and hypergraphs ⋮ A Survey on Covering Supermodular Functions ⋮ Restricted covering of digraphs with arborescences ⋮ Negative circuits for flows and submodular flows ⋮ Proving total dual integrality with cross-free families—A general framework ⋮ Abstract flows over time: a first step towards solving dynamic packing problems ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ Duality for balanced submodular flows ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Rooted \(k\)-connections in digraphs ⋮ A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors ⋮ Discrete convex analysis ⋮ Operations that preserve total dual integrality ⋮ A note on Frank's generalized polymatroids ⋮ Finding feasible vectors of Edmonds-Giles polyhedra ⋮ A note on matchings and separability ⋮ Directed Steiner problems with connectivity constraints

This page was built for publication: