Packing rooted directed cuts in a weighted directed graph
From MaRDI portal
Publication:4769069
DOI10.1007/BF01580218zbMath0283.05104OpenAlexW2084278031WikidataQ92163127 ScholiaQ92163127MaRDI QIDQ4769069
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580218
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Polyhedral proof methods in combinatorial optimization, Popular Branchings and Their Dual Certificates, A note on Steiner tree games, Exact arborescences, matchings and cycles, Lehman's Theorem and the Directed Steiner Tree Problem, Finding popular branchings in vertex-weighted digraphs, Chvátal-Gomory cuts for the Steiner tree problem, A simple algorithm and min-max formula for the inverse arborescence problem, Robustness of minimum cost arborescences, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, The b‐bibranching problem: TDI system, packing, and discrete convexity, The \(b\)-branching problem in digraphs, A ranking model for the greedy algorithm and discrete convexity, Unnamed Item, Finding popular branchings in vertex-weighted directed graphs, Facets of the Stochastic Network Flow Problem, Unnamed Item, The ellipsoid method and its consequences in combinatorial optimization, An additive bounding procedure for the asymmetric travelling salesman problem, On finding optimal polytrees, Blocking optimal arborescences, Proving total dual integrality with cross-free families—A general framework, Transversal matroid intersections and related packings, Blocking pairs of polyhedra arising from network flows, On two minimax theorems in graph, An unbounded matroid intersection polyhedron, The matroids with the max-flow min-cut property, Counting minimum weight arborescences, On the core of network synthesis games, Rooted \(k\)-connections in digraphs, Polyhedra related to a lattice, Minimum directed 1-subtree relaxation for score orienteering problem, Integral decomposition in polyhedra, Packing and covering of crossing families of cuts, Total weak unimodularity: Testing and applications, Optimal subgraphs in a weighted digraph, Inverse optimization problems with multiple weight functions, Popular branchings and their dual certificates
Cites Work
