Pages that link to "Item:Q1363412"
From MaRDI portal
The following pages link to A capacity scaling algorithm for convex cost submodular flows (Q1363412):
Displaying 19 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- Submodular function minimization (Q995782) (← links)
- Minimizing a submodular function arising from a concave function (Q1304480) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- A faster capacity scaling algorithm for minimum cost submodular flow (Q1600097) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems. (Q2773173) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- Capacity scaling algorithm for scalable M-convex submodular flow problems (Q3046542) (← links)
- Capacitated Confluent Flows: Complexity and Algorithms (Q3563015) (← links)
- A capacity scaling algorithm for the constrained maximum flow problem (Q4698231) (← links)
- Data Center Scheduling, Generalized Flows, and Submodularity (Q5194678) (← links)
- Integer Programming and Combinatorial Optimization (Q5712466) (← links)
