Pages that link to "Item:Q1337137"
From MaRDI portal
The following pages link to Minimum cost multiflows in undirected networks (Q1337137):
Displaying 26 items.
- On duality and fractionality of multicommodity flows in directed networks (Q665994) (← links)
- Minimum-cost single-source 2-splittable flow (Q1041715) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem (Q2089770) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks (Q2757586) (← links)
- Approximating the generalized terminal backup problem via half-integral multiflow relaxation (Q2804546) (← links)
- Approximating the generalized terminal backup problem via half-integral multiflow relaxation (Q2955005) (← links)
- (Q3112183) (← links)
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem (Q3541080) (← links)
- A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications (Q4629985) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources (Q4702334) (← links)
- (Q4919164) (← links)
- (Q5020878) (← links)
- Canceling most helpful total cuts for minimum cost network flow (Q5285477) (← links)
- (Q5294046) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- Cost minimizing planning of container inspection and repair in multiple facilities (Q6103189) (← links)
