Cone superadditivity of discrete convex functions
From MaRDI portal
Publication:715073
DOI10.1007/S10107-011-0447-1zbMATH Open1267.90073OpenAlexW2034902505MaRDI QIDQ715073FDOQ715073
Kazuo Murota, Yusuke Kobayashi, Robert Weismantel
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0447-1
Recommendations
Nonlinear programming (90C30) Integer programming (90C10) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Title not available (Why is that?)
- Discrete Convex Analysis
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- Submodular functions and optimization.
- On the foundations of linear and integer linear programming I
- A polynomial oracle-time algorithm for convex integer minimization
- Optimality criterion for a class of nonlinear integer programs.
- Convexity and Steinitz's exchange property
- \(M\)-convex function on generalized polymatroid
- Discrete convex analysis
- Notes on L-/M-convex functions and the separation theorems
- \(M\)-convex functions and tree metrics
- Extension of M-convexity and L-convexity to polyhedral convex functions
- A primal all-integer algorithm based on irreducible solutions
- Title not available (Why is that?)
- On test sets for nonlinear integer maximization
- Test sets of integer programs
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)
