The following pages link to Multi-Commodity Network Flows (Q5736116):
Displaying 50 items.
- A survey on flows in graphs and matroids (Q298967) (← links)
- Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems (Q339711) (← links)
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems (Q444377) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Half-integral five-terminus flows (Q581412) (← links)
- Three commodity flows in graphs (Q594107) (← links)
- Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Ideal clutters (Q697573) (← links)
- The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity (Q864752) (← links)
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight (Q878580) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths (Q958439) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- Distances and cuts in planar graphs (Q1121897) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- A short proof of the two-commodity flow theorem (Q1132734) (← links)
- Disjoint paths in graphs (Q1150632) (← links)
- 2-linked graphs (Q1150633) (← links)
- Multicommodity flows in planar graphs (Q1154916) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- Maximum concurrent flows and minimum cuts (Q1194345) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- A two-commodity cut theorem (Q1250228) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- A \(T_X\)-approach to some results on cuts and metrics (Q1384029) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Performance evaluation for a transportation system in stochastic case (Q1761107) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
