A Fast Algorithm for the Two-Variable Integer Programming Problem
Published in Journal of the ACM • Jan 1, 1984
NobleIDNI9P28W22R69S49
Authors:
Sidnie Dresher Feit
Abstract
An algorithm that solves any two-variable integer programming problem is presented. A constant word-length model for the data is assumed. The complexity for a problem with m constraints and word length of L digits iS bounded by the maximum of two values. The first, which is O(mlogm) steps, is a boun...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!