Most IPs with bounded determinants can be solved in polynomial time.

Joseph Paat Miriam Schlöter Robert Weismantel

Published in: CoRR (2019)

Keyphrases

special case
bounded treewidth
min sum
worst case
truth table
polynomial size
database
data mining
knowledge base
case study
computational complexity
lower bound
search space
integer program