Proximity theorems of discrete convex functions

DOI10.1007/S10107-003-0466-7zbMath1084.90038OpenAlexW2057904949MaRDI QIDQ1881049

Kazuo Murota, Akihisa Tamura

Publication date: 27 September 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0466-7

zbMATH Keywords

optimality criteriadiscrete convex functionsproximity properties

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Related Items (6)

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ Scaling, proximity, and optimization of integrally convex functions ⋮ Recent progress on integrally convex functions ⋮ Recent Developments in Discrete Convex Analysis ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function

This page was built for publication: Proximity theorems of discrete convex functions