Substitutes and complements in network flows viewed as discrete convexity
From MaRDI portal
Publication:2581320
DOI10.1016/j.disopt.2005.04.002zbMath1131.90052OpenAlexW1991523486MaRDI QIDQ2581320
Akiyoshi Shioura, Kazuo Murota
Publication date: 9 January 2006
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.04.002
Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Substitutes and complements in network flow problems
- Discrete convex analysis
- Walrasian equilibrium with gross substitutes
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Notes on L-/M-convex functions and the separation theorems
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- Applications of discrete convex analysis to mathematical economics
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Network flow, transportation and scheduling. Theory and algorithms
- Qualitative Sensitivity Analysis in Monotropic Programming
- M-Convex Function on Generalized Polymatroid
- Substitutes, Complements and Ripples in Network Flows
- Substitutes and Complements in Constrained Linear Models
- Job Matching, Coalition Formation, and Gross Substitutes
- Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems
- Discrete Convex Analysis
- Ripples, complements, and substitutes in generalized networks
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
