Cone superadditivity of discrete convex functions
From MaRDI portal
(Redirected from Publication:715073)
Recommendations
Cites work
- scientific article; zbMATH DE number 3001142 (Why is no real title available?)
- A polynomial oracle-time algorithm for convex integer minimization
- A primal all-integer algorithm based on irreducible solutions
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- Convexity and Steinitz's exchange property
- Discrete Convex Analysis
- Discrete convex analysis
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Network flows. Theory, algorithms, and applications.
- Notes on L-/M-convex functions and the separation theorems
- On test sets for nonlinear integer maximization
- On the foundations of linear and integer linear programming I
- Optimality criterion for a class of nonlinear integer programs.
- Submodular functions and optimization.
- Test sets of integer programs
- \(M\)-convex function on generalized polymatroid
- \(M\)-convex functions and tree metrics
Cited in
(2)
This page was built for publication: Cone superadditivity of discrete convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715073)