Pages that link to "Item:Q1421475"
From MaRDI portal
The following pages link to Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475):
Displaying 11 items.
- Simpler exchange axioms for M-concave functions on generalized polymatroids (Q1742881) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← 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)
- Congestion games viewed from M-convexity (Q1785371) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← 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)
