M-Convex Function on Generalized Polymatroid
From MaRDI portal
Publication:2757584
DOI10.1287/moor.24.1.95zbMath0977.90044OpenAlexW2123812125MaRDI QIDQ2757584
Kazuo Murota, Akiyoshi Shioura
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.1.95
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)
Related Items
M♮-Convexity and Its Applications in Operations, Quadratic M-convex and L-convex functions, Independence systems in gross-substitute valuations, Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems, Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave, Convex analysis and duality over discrete domains, Discrete convexity in joint winner property, M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System, Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function, Strategy-proof school choice mechanisms with minimum quotas and initial endowments, Matroid rank functions and discrete concavity, Shortest bibranchings and valuated matroid intersection, Gross substitutability: an algorithmic survey, The b‐bibranching problem: TDI system, packing, and discrete convexity, Identifying combinatorial valuations from aggregate demand, A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries, A generalized-polymatroid approach to disjoint common independent sets in two matroids, On the Construction of Substitutes, A Dual Approach for Dynamic Pricing in Multidemand Markets, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, Unnamed Item, Characterization and algorithm for bivariate multi-unit assignment valuations, New sufficient conditions for strong unimodality of multivariate discrete distributions, Gross substitution, discrete convexity, and submodularity, Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis, Theory of Principal Partitions Revisited, Recent Developments in Discrete Convex Analysis, A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., DISCRETE CONCAVITY FOR POTENTIAL GAMES, Discrete convexity built on differences, Application of M-convex submodular flow problem to mathematical economics, A framework of discrete DC programming by discrete convex analysis, Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions, Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra, Simpler exchange axioms for M-concave functions on generalized polymatroids, A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions, Envy-free matchings with lower quotas, Indivisible commodities and the nonemptiness of the weak core, Time bounds for iterative auctions: a unified approach by discrete convex analysis, Buyback problem with discrete concave valuation functions, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Discrete convexity and unimodularity. I., Conjugacy relationship between M-convex and L-convex functions in continuous variables, Discrete convexity and equilibria in economies with indivisible goods and money, Applications of discrete convex analysis to mathematical economics, A general two-sided matching market with discrete concave utility functions, A note on discrete convexity and local optimality, Cone superadditivity of discrete convex functions, Relationship of two formulations for shortest bibranchings, Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella., The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions, Some specially structured assemble-to-order systems, Combinatorial auctions with decreasing marginal utilities, Discrete convexity and polynomial solvability in minimum 0-extension problems, Computing Walrasian equilibria: fast algorithms and structural properties, The Finite Matroid-Based Valuation Conjecture is False, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids, ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS, Matroidal Choice Functions, Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Submodular optimization views on the random assignment problem, Extension of M-convexity and L-convexity to polyhedral convex functions, Discrete 2-convex functions, On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market, Market Pricing for Matroid Rank Valuations, Substitutes and complements in network flows viewed as discrete convexity, Discrete polymatroids
