2 citations · 6 across the 6 of their papers we have counts for
4 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…
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing meth…
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
Shunji Umetani
We present a data mining approach for reducing the search space of local search algorithms in a class of binary integer programs including the set covering and partitioning problem…