Planar Integer Linear Programming is NC Equivalent to Euclidean GCD.

David Shallcross Victor Y. Pan Yu Lin-Kriz

Published in: SIAM J. Comput. (1998)

Keyphrases

integer linear programming
bicriteria
column generation
linear inequalities
symmetry breaking
cutting plane
boolean satisfiability
projective geometry
graphical models
euclidean distance
integer programming
global constraints
pseudo boolean
linear programming
blind deconvolution