Pages that link to "Item:Q5712466"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712466):
Displaying 9 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Submodular flow problem with a nonseparable cost function (Q1125610) (← links)
- A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Capacity scaling algorithm for scalable M-convex submodular flow problems (Q3046542) (← links)
- A capacity scaling algorithm for the constrained maximum flow problem (Q4698231) (← links)