Pages that link to "Item:Q1080357"
From MaRDI portal
The following pages link to Combinatorial approaches to multiflow problems (Q1080357):
Displaying 50 items.
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems (Q444377) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- Half-integral five-terminus flows (Q581412) (← links)
- Ideal clutters (Q697573) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- Railway scheduling by network optimization (Q753674) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- New methods for multi-commodity flows (Q920829) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- A canonical decomposition theory for metrics on a finite set (Q1190163) (← links)
- Maximum concurrent flows and minimum cuts (Q1194345) (← links)
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons (Q1280281) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← 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)
- On return path packing. (Q1422393) (← links)
- Maximum balanced flow in a network (Q1569079) (← links)
- On one maximum multiflow problem and related metrics (Q1584451) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Methods of the convex cone theory in the feasibility problem of multicommodity flow (Q1662578) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- Sums of cuts and bipartite metrics (Q1813228) (← links)
- On extremal multiflows (Q1850477) (← links)
- On multiflow lexicographics (Q1864616) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- On the fractionality of the path packing problem (Q1928498) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- On tight spans for directed distances (Q1928578) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Combinatorial approximation algorithms for generalized flow problems (Q2709797) (← links)
- The maximum multiflow problems with bounded fractionality (Q2875137) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- A NOTE ON MULTIFLOW LOCKING THEOREM (Q3081800) (← links)
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)
- On ideal clutters, metrics and multiflows (Q4645929) (← links)
- (Q5020877) (← links)
