Pages that link to "Item:Q1125610"

The following pages link to Submodular flow problem with a nonseparable cost function (Q1125610):

Displaying 19 items.

• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Discrete convex analysis (Q1290668) (← links)
• A constructive proof for the induction of M-convex functions through networks (Q1383387) (← links)
• Minimization of an M-convex function (Q1392577) (← links)
• Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← links)
• Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← 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)
• Fast cycle canceling algorithms for minimum cost submodular flow (Q1882113) (← links)
• Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
• Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
• Convexity and Steinitz's exchange property (Q4645928) (← links)
• Competitive Equilibrium and Trading Networks: A Network Flow Approach (Q4994146) (← links)
• Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
• Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
• Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. (Q5954245) (← 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)