A polynomial time algorithm is presented for solving the following two-variable integer programming problem maximize ClXl + c2x2 subject to a, lxl + a,2x2 =< b,, I = 1, 2, , n, and x~, x2 => O, integers,
No takes yet. Share an insight, caveat, or question.
Ravindran Kannan (1980) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: