Recommendations
Cited in
(76)- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
- Subdivisions of integral base polytopes
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- Beyond JWP: a tractable class of binary VCSPs via M-convex intersection
- Substitutes and complements in network flows viewed as discrete convexity
- Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
- Characterization and algorithm for bivariate multi-unit assignment valuations
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Matroidal choice functions
- Discrete convexity built on differences
- The geometry of geometries: matroid theory, old and new
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Recent developments in discrete convex analysis
- Applications of discrete convex analysis to mathematical economics
- A general two-sided matching market with discrete concave utility functions
- A tractable class of binary VCSPs via M-convex intersection
- Shortest bibranchings and valuated matroid intersection
- Gross substitution, discrete convexity, and submodularity
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Coordinatewise domain scaling algorithm for M-convex function minimization
- Congestion games viewed from M-convexity
- A capacity scaling algorithm for M-convex submodular flow
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
- Convex analysis and duality over discrete domains
- scientific article; zbMATH DE number 3897716 (Why is no real title available?)
- Application of M-convex submodular flow problem to mathematical economics
- A vector exchange property of submodular systems
- On basic operations related to network induction of discrete convex functions
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Discrete convexity and equilibria in economies with indivisible goods and money
- On circuit valuation of matroids
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis
- Induction of M-convex functions by linking systems
- Identifying combinatorial valuations from aggregate demand
- The quadratic M-convexity testing problem
- Discrete convexity and unimodularity. I.
- \(M\)-convex functions and tree metrics
- Characterizing and recognizing generalized polymatroids
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- Even factors, jump systems, and discrete convexity
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- Cone superadditivity of discrete convex functions
- Minimization of an M-convex function
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- A constructive proof for the induction of M-convex functions through networks
- Gross substitutability: an algorithmic survey
- Computing Walrasian equilibria: fast algorithms and structural properties
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Discrete convex analysis
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- DISCRETE CONCAVITY FOR POTENTIAL GAMES
- A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
- Convexity and Steinitz's exchange property
- Optimization theory on antichains with the Steinitz exchange property
- A note on discrete convexity and local optimality
- On the construction of substitutes
- Quadratic M-convex and L-convex functions
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
- Buyback problem with discrete concave valuation functions
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Submodular function minimization
- Discrete polymatroids
- Fenchel-type duality for matroid valuations
- A survey of fundamental operations on discrete convex functions of various kinds
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
This page was built for publication: Convexity and Steinitz's exchange property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677484)
