A Fast Algorithm for the Two-Variable Integer Programming Problem-Reference-Cited by-同舟云学术

A Fast Algorithm for the Two-Variable Integer Programming Problem

Published:1984-01 Issue:1 Volume:31 Page:99-113
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Feit Sidnie Dresher¹

Affiliation:

1. I.T.T. Programming, 1000 Oronoque Lane, Stratford, CT

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference5 articles.

1. A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

2. A Polynomial Algorithm for the Two-Variable Integer Programming Problem

3. LENSTRA H W Integer programming with a fixed number of variables. Rep. 81-03 Mathematisch Insutuut Amsterdam. LENSTRA H W Integer programming with a fixed number of variables. Rep. 81-03 Mathematisch Insutuut Amsterdam.

4. SCARF H.E. Production sets with indlv~sibilitms. Econometrtca ( 1981). SCARF H.E. Production sets with indlv~sibilitms. Econometrtca ( 1981).

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integer Location Problems;Contributions to Location Analysis;2019

2. Integer Programming and Algorithmic Geometry of Numbers;50 Years of Integer Programming 1958-2008;2009-11-06

3. Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model;Image and Vision Computing;2007-10

4. Integer Programming, Lattices, and Results in Fixed Dimension;Discrete Optimization;2005

5. A linear algorithm for integer programming in the plane;Mathematical Programming;2004-07-07