Pages that link to "Item:Q4339374"
From MaRDI portal
The following pages link to Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost (Q4339374):
Displaying 8 items.
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← 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)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)