Pages that link to "Item:Q1591359"
From MaRDI portal
The following pages link to Notes on L-/M-convex functions and the separation theorems (Q1591359):
Displaying 43 items.
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← 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)
- Convex analysis and duality over discrete domains (Q1660291) (← links)
- Projection and convolution operations for integrally convex functions (Q1727752) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Discrete convexity and unimodularity. I. (Q1763636) (← 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)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Notes on \(L(D)\)-convex sets (Q1900725) (← links)
- Complete characterization of Yannelis-Zame and Chichilnisky-Kalman-Mas-Colell properness conditions on preferences for separable concave functions defined in \(L_ +^ p\) and \(L^ p\) (Q1920966) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Directed discrete midpoint convexity (Q2024598) (← links)
- Discrete 2-convex functions (Q2089790) (← links)
- Note on the polyhedral description of the Minkowski sum of two L-convex sets (Q2111552) (← links)
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions (Q2135548) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Discrete convexity built on differences (Q2452051) (← links)
- A note on discrete convexity and local optimality (Q2493486) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis (Q2696978) (← links)
- On polyhedral approximation of L-convex and M-convex functions (Q2793587) (← links)
- M^♮-convexity and ultramodularity on integer lattice (Q2944190) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- The equivalence of discrete convexity and the classical definition of convexity (Q3517662) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming (Q4971025) (← links)
- Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005) (Q4971584) (← links)
- A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
- On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. (Q5954245) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)
