Pages that link to "Item:Q1777220"
From MaRDI portal
The following pages link to A capacity scaling algorithm for M-convex submodular flow (Q1777220):
Displaying 17 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)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← 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)
- Competitive Equilibrium and Trading Networks: A Network Flow Approach (Q4994146) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- Integer Programming and Combinatorial Optimization (Q5712466) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)
