scientific article; zbMATH DE number 7274133

zbMath1453.90135arXiv1811.04177MaRDI QIDQ5133135

Shunji Umetani, Yoshinobu Kawahara, Naoya Uematsu

Publication date: 12 November 2020

Full work available at URL: https://arxiv.org/abs/1811.04177

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-cut algorithmcombinatorial optimizationsubmodular function maximizationinteger programming problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Constraint generation approaches for submodular function maximization leveraging graph properties ⋮ Using atomic bounds to get sub-modular approximations

This page was built for publication: