A Fast Algorithm for the Two-Variable Integer Programming Problem

DOI10.1145/2422.322417MaRDI QIDQ3783845zbMATH OpenOpenAlexFDO

Authors Sidnie Dresher Feit

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422.322417

zbMATH Keywords

minimal binding set of constraintsthree constraint problemstwo-variable problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• Algorithms and Computation
• scientific article; zbMATH DE number 1757949
• A linear algorithm for integer programming in the plane
• scientific article; zbMATH DE number 1405787
• EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING

Cited in

(10)

• Lower time bounds for integer programming with two variables
• A new O(n \,n) algorithm for computing the intersection of convex polygons
• A new reduction method in integer programming
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A linear algorithm for integer programming in the plane
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• scientific article; zbMATH DE number 1757949 (Why is no real title available?)
• scientific article; zbMATH DE number 1405787 (Why is no real title available?)
• Algorithms and Computation

This page was built for publication: A Fast Algorithm for the Two-Variable Integer Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783845)