101 citations · 312 across the 33 of their papers we have counts for
3 papers · 1 filter
An efficient branch-and-cut algorithm for approximately submodular function maximization
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
When approaching to problems in computer science, we often encounter situations where a subset of a finite set maximizing some utility function needs to be selected. Some of such u…
An efficient branch-and-bound algorithm for submodular function maximization
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
The submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible…
Prismatic Algorithm for Discrete D.C. Programming Problems
Yoshinobu Kawahara, Takashi Washio
In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. Th…