A Fast Algorithm for the Two-Variable Integer Programming Problem

DOI10.1145/2422.322417zbMath0642.90075OpenAlexW2063284252MaRDI QIDQ3783845

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

two-variable problemminimal binding set of constraintsthree constraint problems

Mathematics Subject Classification ID

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

Related Items (3)

A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons ⋮ A linear algorithm for integer programming in the plane ⋮ Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles

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