no code implementations • 26 Apr 2019 • Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
For the problem of maximizing an approximately submodular function (ASFM problem), a greedy algorithm quickly finds good feasible solutions for many instances while guaranteeing ($1-e^{-\gamma}$)-approximation ratio for a given submodular ratio $\gamma$.
no code implementations • 10 Nov 2018 • Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
Nemhauser and Wolsey developed an exact algorithm called the constraint generation algorithm that starts from a reduced BIP problem with a small subset of constraints taken from the constraints and repeats solving a reduced BIP problem while adding a new constraint at each iteration.
