Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
From MaRDI portal
Publication:1410696
DOI10.1016/S0166-218X(02)00468-7zbMath1030.90085MaRDI QIDQ1410696
Kazuo Murota, Akiyoshi Shioura
Publication date: 14 October 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
M♮-Convexity and Its Applications in Operations, New sufficient conditions for strong unimodality of multivariate discrete distributions, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., Coordinatewise domain scaling algorithm for M-convex function minimization, A note on discrete convexity and local optimality, On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Submodular flow problem with a nonseparable cost function
- Generalized concavity
- Discrete convex analysis
- Minimization of an M-convex function
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Notes on L-/M-convex functions and the separation theorems
- M-Convex Function on Generalized Polymatroid
- Recent Developments in Discrete Convex Analysis
- Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
- Monotone Comparative Statics
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
