Discrete Convex Analysis
From MaRDI portal
Publication:4425020
Recommendations
Cited in
(only showing first 100 items - show all)- A note on a two-sided discrete-concave market with possibly bounded salaries
- \(M\)-convex functions and tree metrics
- Envy-free matchings with lower quotas
- Local minima, marginal functions, and separating hyperplanes in discrete optimization
- Second‐order necessary optimality conditions for discrete‐time stochastic systems
- Tropical medians by transportation
- Polypositroids
- Spatio-temporal pricing for ridesharing platforms
- Beyond JWP: a tractable class of binary VCSPs via M-convex intersection
- Adaptive sampling line search for local stochastic optimization with integer variables
- On convolution ofL-convex functions
- Discrete convexity and its applications
- Discrete-to-continuous extensions: Lovász extension and Morse theory
- Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- Convex analysis in groups and semigroups: a sampler
- A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
- Projection and convolution operations for integrally convex functions
- scientific article; zbMATH DE number 7559054 (Why is no real title available?)
- Logarithmic concavity for morphisms of matroids
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Combinatorial integer labeling theorems on finite sets with applications
- Monge properties, discrete convexity and applications
- Influence maximization problem: properties and algorithms
- A note on M-convex functions on jump systems
- On substitutability and complementarity in discrete choice models
- Applications of discrete convex analysis to mathematical economics
- Private Bayesian persuasion
- Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time
- Discrete Newton methods for the evacuation problem
- Agreeable bets with multiple priors
- Total variation on a tree
- Submodular function minimization
- Market pricing for matroid rank valuations
- A discrete convex min-max formula for box-TDI polyhedra
- Coordinating inventory control and pricing strategies for perishable products
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- A Characterization of Combinatorial Demand
- Identifying combinatorial valuations from aggregate demand
- Resolution of ideals associated to subspace arrangements
- A note on M-convexity in polyhedral split decomposition of distances
- Legendre duality in combinatorial study of matrix pencils
- Matroids from hypersimplex splits
- Global optimization for first order Markov random fields with submodular priors
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- Efficient matching under general constraints
- Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Majorization permutahedra and (0,1)-matrices
- Dijkstra's algorithm and L-concave function maximization
- Matching with partially ordered contracts
- Integrality of subgradients and biconjugates of integrally convex functions
- Consistency of the doctor-optimal equilibrium price vector in job-matching markets
- Matroids on Eight Elements with the Half-Plane Property and Related Concepts
- Continuous relaxation for discrete DC programming
- Uniform modular lattices and affine buildings
- Generalized Permutohedra from Probabilistic Graphical Models
- On set functions that can be extended to convex functionals
- Optimization problems with color-induced budget constraints
- The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Convexity result and trees with large Balaban index
- Discrete convex functions on graphs and their algorithmic applications
- A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Tropical flag varieties
- Conic relaxation approaches for equal deployment problems
- Discrete convexity built on differences
- A generalization of the space of complete quadrics
- Scaling, proximity, and optimization of integrally convex functions
- A general two-sided matching market with discrete concave utility functions
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Submodular functions: learnability, structure, and optimization
- Cone superadditivity of discrete convex functions
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- Computing Walrasian equilibria: fast algorithms and structural properties
- Spaces of Lorentzian and real stable polynomials are Euclidean balls
- Quadratic M-convex and L-convex functions
- Independence systems in gross-substitute valuations
- Optimization problems with color-induced budget constraints
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Gross substitutability: an algorithmic survey
- Continuous relaxation for discrete DC programming
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Topological convexities, selections and fixed points
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra
- Approximation algorithms for the submodular hitting set problem
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Approximating convex functions via non-convex oracles under the relative noise model
- Buyback problem with discrete concave valuation functions
- Inventory rotation of medical supplies for emergency response
- Walrasian equilibria from an optimization perspective: A guide to the literature
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Randomized algorithms for finding the shortest negative cost cycle in networks
- A note on submodular function minimization with covering type linear constraints
This page was built for publication: Discrete Convex Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425020)
