Pages that link to "Item:Q4133435"
From MaRDI portal
The following pages link to A generalization of max flow—min cut (Q4133435):
Displaying 50 items.
- On switching paths polyhedra (Q579630) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Path-closed sets (Q802569) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On total dual integrality (Q1159081) (← links)
- Total dual integrality and b-matchings (Q1167664) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- Circuits in graphs embedded on the torus (Q1199633) (← links)
- On partitions of a partially ordered set (Q1245831) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Switchdec polyhedra (Q1363748) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On totally dual integral systems (Q1824553) (← links)
- Operations that preserve total dual integrality (Q1837522) (← links)
- Extending Greene's theorem to directed graphs (Q1838495) (← links)
- Nowhere-zero flows in random graphs (Q1850523) (← links)
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\) (Q1900147) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Flows on measurable spaces (Q2041865) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Efficient algorithms for abstract flow with partial switching (Q2079298) (← links)
- Abstract network flow with intermediate storage for evacuation planning (Q2103018) (← links)
- The max-flow min-cut property and \(\pm 1\)-resistant sets (Q2217497) (← links)
- Abstract flows over time: a first step towards solving dynamic packing problems (Q2250460) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- On the vehicle routing problem with lower bound capacities (Q2861522) (← links)
- A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- A Minimal Totally Dual Integral Defining System for the <i>b</i>-Matching Polyhedron (Q3669184) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Total dual integrality implies local strong unimodularity (Q3771976) (← links)
- Connected and alternating vectors: Polyhedra and algorithms (Q3895223) (← links)
- (Q5020876) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
