The following pages link to (Q4149476):
Displaying 50 items.
- Extended cuts (Q266025) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Characterizing and recognizing generalized polymatroids (Q403645) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- On switching paths polyhedra (Q579630) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Ideal clutters (Q697573) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- A flow model based on polylinking system (Q715085) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- On the core of network synthesis games (Q757264) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Canonical decompositions of symmetric submodular systems (Q760444) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- A note on matchings and separability (Q802467) (← links)
- Path-closed sets (Q802569) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
- Minmax relations for cyclically ordered digraphs (Q885290) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Short proofs on the matching polyhedron (Q1050377) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem (Q1083364) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Greedoid polyhedra (Q1097283) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
