On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application

From MaRDI portal
Publication:5630839

DOI10.1137/0121018zbMath0224.90049OpenAlexW2063885213MaRDI QIDQ5630839

Bruce L. Miller

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0121018




Related Items (23)

Quadratic M-convex and L-convex functionsExistence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concaveConvex analysis and duality over discrete domainsReciprocity in the principal-multiple agent modelNew sufficient conditions for strong unimodality of multivariate discrete distributionsQuasi M-convex and L-convex functions -- quasiconvexity in discrete optimizationOptimization problems with cone constraints in groups and semigroups: an approach based on image space analysisRecent Developments in Discrete Convex AnalysisFast scaling algorithms for M-convex function minimization with application to the resource allocation problem.DISCRETE CONCAVITY FOR POTENTIAL GAMESDiscrete convexity built on differencesToward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar StatesA framework of discrete DC programming by discrete convex analysisA discrete dynamic convexized method for nonlinear integer programmingApproximating convex functions via non-convex oracles under the relative noise modelConjugacy relationship between M-convex and L-convex functions in continuous variablesAn approximate algorithm for nonlinear integer programmingA note on discrete convexity and local optimalityRelationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear ProgrammingTechnical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005)An enumerative algorithm framework for a class of nonlinear integer programming problemsUnit integer quadratic binary programming




This page was built for publication: On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application