Pages that link to "Item:Q5630839"
From MaRDI portal
The following pages link to On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application (Q5630839):
Displaying 23 items.
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Unit integer quadratic binary programming (Q1053599) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization (Q1410696) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Convex analysis and duality over discrete domains (Q1660291) (← links)
- Reciprocity in the principal-multiple agent model (Q1675000) (← links)
- New sufficient conditions for strong unimodality of multivariate discrete distributions (Q1701085) (← links)
- Approximating convex functions via non-convex oracles under the relative noise model (Q1751103) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Discrete convexity built on differences (Q2452051) (← links)
- A note on discrete convexity and local optimality (Q2493486) (← links)
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave (Q2636818) (← links)
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis (Q2696978) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- DISCRETE CONCAVITY FOR POTENTIAL GAMES (Q3530501) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← 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)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. (Q5954245) (← links)