Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming
From MaRDI portal
Publication:4971025
DOI10.1137/19M1281678zbMath1480.90173MaRDI QIDQ4971025
Jun Li, Giandomenico Mastroeni
Publication date: 8 October 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Convex analysis and nonlinear optimization. Theory and examples.
- Discrete convex analysis
- Notes on L-/M-convex functions and the separation theorems
- Convex analysis and duality over discrete domains
- Convex optimization on mixed domains
- Convex analysis in groups and semigroups: a sampler
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Nonlinear integer programming
- A note on discrete convexity and local optimality
- Convexity in cristallographical lattices
- M-Convex Function on Generalized Polymatroid
- Convexity and Optimization in Banach Spaces
- Some remarks on convex analysis in topological groups
- Outline of an algorithm for integer solutions to linear programs
- Integer Programming and Pricing
- Variational Analysis
- Discrete Convex Analysis
- Convex Analysis
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming
