On basic operations related to network induction of discrete convex functions
From MaRDI portal
Publication:4999338
DOI10.1080/10556788.2020.1818080zbMath1470.90055arXiv2001.03018OpenAlexW3087206551MaRDI QIDQ4999338
Publication date: 6 July 2021
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03018
aggregationsplittingdiscrete convex analysisintegrally convex functionmultimodular functionnetwork induction
Related Items
Discrete Fenchel duality for a pair of integrally convex and separable convex functions, Recent progress on integrally convex functions, On the correlation gap of matroids, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- A new method of proving structural properties for certain class of stochastic dynamic control problems
- Solving discrete systems of nonlinear equations
- Convexity and Steinitz's exchange property
- \(\Delta\)-matroid and jump system
- Induction of M-convex functions by linking systems
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Discrete convex analysis
- A constructive proof for the induction of M-convex functions through networks
- Discrete-event control of stochastic networks: multimodularity and regularity.
- Application of M-convex submodular flow problem to mathematical economics
- Notes on L-/M-convex functions and the separation theorems
- Projection and convolution operations for integrally convex functions
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Pfaffian forms and \(\Delta\)-matroids
- A survey of Markov decision models for control of networks of queues
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Directed discrete midpoint convexity
- A note on M-convex functions on jump systems
- Integrality of subgradients and biconjugates of integrally convex functions
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Scaling, proximity, and optimization of integrally convex functions
- Discrete fixed point analysis and its applications
- Even factors, jump systems, and discrete convexity
- Submodular functions and optimization.
- Discrete fixed point theorem reconsidered
- Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
- M-Convex Function on Generalized Polymatroid
- Multimodularity, Convexity, and Optimization Properties
- The Logic of Logistics
- Recent Developments in Discrete Convex Analysis
- Discrete Concavity and the Half-Plane Property
- On the Solutions of Discrete Nonlinear Complementarity and Related Problems
- Extremal Splittings of Point Processes
- CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
- Discrete Convex Analysis
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- Optimal control of service rates in networks of queues
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- A Class of Team Problems with Discrete Action Spaces: Optimality Conditions Based on Multimodularity
- Optimal Matching Forests and Valuated Delta-Matroids
- A survey of fundamental operations on discrete convex functions of various kinds
- Discrete Midpoint Convexity
- On Fundamental Operations for Multimodular Functions
- Operations on M‐Convex Functions on Jump Systems
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- Note on Multimodularity and L-Convexity
- Matrices and matroids for systems analysis
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
