scientific article; zbMATH DE number 1757949

MaRDI QIDQ4537737zbMATH OpenFDO

Authors Friedrich Eisenbrand, Günter Rote

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810078

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A Fast Algorithm for the Two-Variable Integer Programming Problem
• Algorithms and Computation
• Fast integer programming in fixed dimension
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Efficient algorithms for integer programs with two variables per constraint.
• scientific article; zbMATH DE number 1405787
• Lower time bounds for integer programming with two variables
• Integer programming with 2-variable equations and 1-variable inequalities
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Binary integer programs with two variables per inequality

Cited in

(10)

• Lower time bounds for integer programming with two variables
• A linear algorithm for integer programming in the plane
• Efficient lattice width computation in arbitrary dimension
• A Fast Algorithm for the Two-Variable Integer Programming Problem
• scientific article; zbMATH DE number 1405787 (Why is no real title available?)
• Algorithms and Computation
• Fast integer programming in fixed dimension
• Computing efficiently the lattice width in any dimension
• Lattice angles of lattice polygons
• Integer programming with 2-variable equations and 1-variable inequalities

This page was built for publication:

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