Convexity and Steinitz's exchange property
From MaRDI portal
Publication:677484
DOI10.1006/AIMA.1996.0084zbMATH Open0867.90092OpenAlexW2035186046MaRDI QIDQ677484FDOQ677484
Publication date: 28 May 1997
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aima.1996.0084
convex analysissubmodular functionsweighted matroid intersectiondiscrete separation theoremsFrenchel-type min-max theoreminteger lattice points
Convex programming (90C25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (73)
- \(M\)-convex functions and tree metrics
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Characterizing and recognizing generalized polymatroids
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- On the Construction of Substitutes
- Applications of discrete convex analysis to mathematical economics
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION โ A VIEW FROM DISCRETE CONVEX ANALYSIS
- Submodular function minimization
- Identifying combinatorial valuations from aggregate demand
- Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
- Recent Developments in Discrete Convex Analysis
- Convexity and Steinitz's exchange property
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Discrete convexity built on differences
- A general two-sided matching market with discrete concave utility functions
- Cone superadditivity of discrete convex functions
- Computing Walrasian equilibria: fast algorithms and structural properties
- Quadratic M-convex and L-convex functions
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- Gross substitutability: an algorithmic survey
- Buyback problem with discrete concave valuation functions
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Fenchel-type duality for matroid valuations
- Gross substitution, discrete convexity, and submodularity
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Application of M-convex submodular flow problem to mathematical economics
- Discrete convexity and unimodularity. I.
- Minimization of an M-convex function
- Congestion games viewed from M-convexity
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- A constructive proof for the induction of M-convex functions through networks
- Discrete polymatroids
- Substitutes and complements in network flows viewed as discrete convexity
- Coordinatewise domain scaling algorithm for M-convex function minimization
- A capacity scaling algorithm for M-convex submodular flow
- A note on discrete convexity and local optimality
- Induction of M-convex functions by linking systems
- Convex analysis and duality over discrete domains
- Even factors, jump systems, and discrete convexity
- Discrete convex analysis
- Shortest bibranchings and valuated matroid intersection
- On basic operations related to network induction of discrete convex functions
- DISCRETE CONCAVITY FOR POTENTIAL GAMES
- Discrete convexity and equilibria in economies with indivisible goods and money
- Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
- The quadratic M-convexity testing problem
- A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
- A survey of fundamental operations on discrete convex functions of various kinds
- Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming
- A Tractable Class of Binary VCSPs via M-Convex Intersection
- On circuit valuation of matroids
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection.
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
- Characterization and algorithm for bivariate multi-unit assignment valuations
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Subdivisions of integral base polytopes
- The geometry of geometries: matroid theory, old and new
- Matroidal Choice Functions
Recommendations
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)