M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
From MaRDI portal
Publication:3105769
DOI10.1137/080736156zbMath1236.90082OpenAlexW2084134548MaRDI QIDQ3105769
Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura
Publication date: 9 January 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cf6d768849db2f0bfb4b05e49e22876c364195d3
Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
Algorithms for separable convex optimization with linear ascending constraints, M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System, On a Reduction for a Class of Resource Allocation Problems, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Scaling, proximity, and optimization of integrally convex functions, Continuous Relaxation for Discrete DC Programming, Simpler exchange axioms for M-concave functions on generalized polymatroids, Continuous relaxation for discrete DC programming, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Decreasing minimization on M-convex sets: algorithms and applications, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
