Pages that link to "Item:Q1841175"

The following pages link to Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175):

Displaying 19 items.

• Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← links)
• A note on \(M\)-convexity in polyhedral split decomposition of distances (Q691985) (← links)
• Cone superadditivity of discrete convex functions (Q715073) (← links)
• Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
• New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)
• Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
• Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
• Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
• Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
• Quadratic M-convex and L-convex functions (Q1883382) (← links)
• Directed discrete midpoint convexity (Q2024598) (← links)
• Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra (Q2237937) (← links)
• Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
• A new way to extend t-norms, t-conorms and negations (Q2351613) (← links)
• Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← 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)
• (Q5002781) (← links)
• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)