Quadratic M-convex and L-convex functions
From MaRDI portal
Publication:1883382
DOI10.1016/j.aam.2003.11.001zbMath1126.90399OpenAlexW2016802101MaRDI QIDQ1883382
Kazuo Murota, Akiyoshi Shioura
Publication date: 12 October 2004
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2003.11.001
Related Items
M♮-Convexity and Its Applications in Operations, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, The quadratic M-convexity testing problem, Conjugacy relationship between M-convex and L-convex functions in continuous variables, \(M\)-convex functions and tree metrics, A Tractable Class of Binary VCSPs via M-Convex Intersection
Cites Work
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Convexity and Steinitz's exchange property
- Submodular functions and optimization
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- Discrete convex analysis
- Dirichlet forms and symmetric Markov processes
- Notes on L-/M-convex functions and the separation theorems
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- Extension of M-convexity and L-convexity to polyhedral convex functions
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- M-Convex Function on Generalized Polymatroid
- Iterative Solution Methods
- Discrete Convex Analysis
- An Algorithm for Submodular Functions on Graphs
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- Convex separable optimization is not much harder than linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
