The following pages link to (Q3859792):
Displayed 16 items.
- Packing and covering of crossing families of cuts (Q789399) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Polyhedra related to a lattice (Q3911666) (← links)