Polynomial time certifying algorithms for the planar quantified integer programming problem.

Z. Liang K. Subramani James Worthington

Published in: J. Log. Comput. (2013)

Keyphrases

integer programming
computational complexity
inference problems
worst case
learning algorithm
production planning
network flow
cutting plane
linear programming
heuristic search
constraint programming
set covering
cutting plane algorithm
np hard
convergence rate
approximation algorithms