Pages that link to "Item:Q3046542"
From MaRDI portal
The following pages link to Capacity scaling algorithm for scalable M-convex submodular flow problems (Q3046542):
Displaying 11 items.
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← 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)
- A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS (Q3456031) (← links)
- A capacity scaling algorithm for the constrained maximum flow problem (Q4698231) (← links)
- Competitive Equilibrium and Trading Networks: A Network Flow Approach (Q4994146) (← links)
- Data Center Scheduling, Generalized Flows, and Submodularity (Q5194678) (← links)
- Integer Programming and Combinatorial Optimization (Q5712466) (← links)