On polyhedral approximation of L-convex and M-convex functions

DOI10.15807/JORSJ.58.291zbMATH Open1343.90104OpenAlexW1640190026MaRDI QIDQ2793587

Kazuo Murota

Publication date: 16 March 2016

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.58.291

zbMATH Keywords

polyhedral approximationdiscrete optimizationdiscrete convex analysisM-convex functionL-convex function

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: On polyhedral approximation of L-convex and M-convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2793587)