Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality

  title={Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality},
  author={Dorit S. Hochbaum and Joseph Naor},
  journal={SIAM J. Comput.},
The authors present an $O(mn^2 \log m)$ algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier--Motzkin elimination method. [] Key Result However, it is shown that both a feasible solution and an optimal solution with respect to an arbitrary objective function can be computed in pseudo-polynomial time.

Figures from this paper

Efficient Algorithms for Integer Programs with Two Variables per Constraint
This work develops an O(nmU) time and O(m) space 2-approximation algorithm for the positively weighted minimization problem for the general case and generalizes all results to non linear constraints and to nonlinear (but monotone) weight functions.
Efficient Algorithms for Integer Programs with Two Variables per Constraint1
Using the local-ratio technique, an O(nmU) time and O(m) space 2 -approximation algorithm is developed for the positively weighted minimization problem for the general case and generalize all results to nonlinear constraints and to non linear (but monotone) weight functions.
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
  • D. Hochbaum
  • Mathematics, Computer Science
    Eur. J. Oper. Res.
  • 2002
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition
This paper reveals a new efficiently solvable subclass of the feasibility problem of integer linear systems where each inequality has at most two variables, and presents an algorithm that runs in polynomial time.
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
The algorithm described is, in particular, a 2-approximation algorithm for the problem of minimizing the total weight of true variables, among all truth assignments to the 2-satisfiability problem, which has an identifiable subset of integer components that retain their value in an integer optimal solution of the problem.
Applications and efficient algorithms for integer programming problems on monotone constraints
This article demonstrates the vast applicability of IP2 and IP3 as models for integer programs in multiple scenarios and shows that if there is flexibility in the modeling of an integer programming problem, the formulation choice as monotone IP2 or IP3 leads to efficient algorithms, whereas slightly different modeling choices would lead to NP-hard problems.
Instant Recognition of Half Integrality and 2-Approximations
The approximation algorithms here provide an improvement in running time and range of applicability compared to existing 2-approximations and conclude that problems in the framework are MAX SNP-hard and at least as hard to approximate as vertex cover.
Approximability of Integer Programming with Generalised Constraints
A complete classification for the approximability of all maximal constraint languages, and a complete classification of the approxIMability of the problem when the set of allowed constraints contains all permutation constraints are presented.
A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality
A strongly polynomial label-correcting algorithm for solving the feasibility of linear systems with two variables per inequality (2VPI) based on the Newton-Dinkelbach method for fractional combinatorial optimization.


Combinatorial algorithms for optimization problems
  • E. Cohen
  • Mathematics, Computer Science
  • 1992
This thesis considers several combinatorial optimization problems that can be viewed as classes of linear programming problems with special structure and develops a technique that extends the classes of problems known to have strongly polynomial algorithms, or known to be quickly solvable in parallel.
An $n^{log n}$ algorithm for the two-variable-per-constraint linear programming satisfiability problem
A simple algorithm is described which determines the satisfiability over the reals of a conjunction of linear inequalities, none of which contains more than two variables, which is particularly suited to applications in mechanical program verification.
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
  • Bengt Aspvall, Y. Shiloach
  • Mathematics, Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
A constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality with polynomial in the size of the input is presented.
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
It is shown that strongly polynomial algorithms exist for any fixed dimension d and these algorithms also establish membership in the class NC.
The computational complexity of simultaneous Diophantine approximation problems
  • J. Lagarias
  • Mathematics, Computer Science
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
It is shown that the problem of deciding whether a given vector α of rational numbers has a simultaneous approximation of specified accuracy with respect to the sup norm with denominator Q in a given interval 1 ≤ Q ≤ N is NP-complete.
A new approach to the maximum flow problem
By incorporating the dynamic tree data structure of Sleator and Tarjan, a version of the algorithm running in O(nm log(n'/m)) time on an n-vertex, m-edge graph is obtained, as fast as any known method for any graph density and faster on graphs of moderate density.
Deciding Linear Inequalities by Computing Loop Residues
V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes of the form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is
Maximal Closure of a Graph and Applications to Combinatorial Problems
This paper generalizes the selection problem discussed by J. M. Rhys [Rhys, J. M. W. 1970. Shared fixed cost and network flows. Management Sci.17 3, November.], J. D. Murchland [Murchland, J. D.
The Lattice Structure of Flow in Planar Graphs
It is shown how to compactly encode the entire lattice and it is shown that the set of solutions to the min-cost flow problem forms a sublattice in the presented lattice.
Integer Programming with a Fixed Number of Variables
It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.