Pages that link to "Item:Q4769069"

The following pages link to Packing rooted directed cuts in a weighted directed graph (Q4769069):

Displaying 37 items.

• On finding optimal polytrees (Q500966) (← links)
• Blocking optimal arborescences (Q507342) (← links)
• On the core of network synthesis games (Q757264) (← links)
• Packing and covering of crossing families of cuts (Q789399) (← links)
• Total weak unimodularity: Testing and applications (Q798401) (← links)
• Rooted \(k\)-connections in digraphs (Q1025990) (← links)
• Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
• Exact arborescences, matchings and cycles (Q1095157) (← links)
• The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
• On two minimax theorems in graph (Q1229885) (← links)
• An unbounded matroid intersection polyhedron (Q1244236) (← links)
• The matroids with the max-flow min-cut property (Q1245970) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• Counting minimum weight arborescences (Q1799229) (← links)
• Robustness of minimum cost arborescences (Q1926648) (← links)
• Inverse optimization problems with multiple weight functions (Q2112661) (← links)
• Popular branchings and their dual certificates (Q2118146) (← links)
• Finding popular branchings in vertex-weighted digraphs (Q2154110) (← links)
• The \(b\)-branching problem in digraphs (Q2192110) (← links)
• A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
• Finding popular branchings in vertex-weighted directed graphs (Q2693638) (← links)
• A note on Steiner tree games (Q2892158) (← links)
• Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
• Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
• Polyhedra related to a lattice (Q3911666) (← links)
• Optimal subgraphs in a weighted digraph (Q3950327) (← links)
• Transversal matroid intersections and related packings (Q4126086) (← links)
• Integral decomposition in polyhedra (Q4740329) (← links)
• (Q5005108) (← links)
• Popular Branchings and Their Dual Certificates (Q5041748) (← links)
• Facets of the Stochastic Network Flow Problem (Q5124001) (← links)
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)
• The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)