Minimizing a submodular function arising from a concave function
From MaRDI portal
Publication:1304480
DOI10.1016/S0166-218X(99)00051-7zbMath0973.90059MaRDI QIDQ1304480
Satoru Fujishige, Satoru Iwata
Publication date: 5 December 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Minimizing a sum of submodular functions
Cites Work
- Majorization and the Lorenz order: a brief introduction
- Submodular functions and optimization
- A capacity scaling algorithm for convex cost submodular flows
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Majorization on a Partially Ordered Set
- Selected Applications of Minimum Cuts in Networks
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- A Fast Parametric Maximum Flow Algorithm and Applications
