Packing rooted directed cuts in a weighted directed graph
From MaRDI portal
Cites work
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3316608 (Why is no real title available?)
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- On the width—length inequality
- The extremal length of a network
Cited in
(37)- Rooted \(k\)-connections in digraphs
- Polyhedral proof methods in combinatorial optimization
- Exact arborescences, matchings and cycles
- The ellipsoid method and its consequences in combinatorial optimization
- An additive bounding procedure for the asymmetric travelling salesman problem
- 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
- Minimum directed 1-subtree relaxation for score orienteering problem
- Counting minimum weight arborescences
- Robustness of minimum cost arborescences
- Inverse optimization problems with multiple weight functions
- Popular branchings and their dual certificates
- Finding popular branchings in vertex-weighted digraphs
- The \(b\)-branching problem in digraphs
- A ranking model for the greedy algorithm and discrete convexity
- Chvátal-Gomory cuts for the Steiner tree problem
- A simple algorithm and min-max formula for the inverse arborescence problem
- Finding popular branchings in vertex-weighted directed graphs
- A note on Steiner tree games
- Proving total dual integrality with cross-free families—A general framework
- Lehman's theorem and the directed Steiner tree problem
- Polyhedra related to a lattice
- Optimal subgraphs in a weighted digraph
- Transversal matroid intersections and related packings
- Integral decomposition in polyhedra
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- On finding optimal polytrees
- Popular branchings and their dual certificates
- Facets of the stochastic network flow problem
- 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
- scientific article; zbMATH DE number 7692724 (Why is no real title available?)
- On the core of network synthesis games
- Packing and covering of crossing families of cuts
- Total weak unimodularity: Testing and applications
This page was built for publication: Packing rooted directed cuts in a weighted directed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4769069)
