Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality
暂无分享,去创建一个
[1] MegiddoNimrod,et al. Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs , 1993 .
[2] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[3] Günter Rote,et al. Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane , 1987, ICALP.
[4] Bengt Aspvall,et al. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[5] E. Cohen,et al. Combinatorial algorithms for optimization problems , 1991 .
[6] G. Grätzer,et al. Lattice Theory: First Concepts and Distributive Lattices , 1971 .
[7] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[8] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .
[9] Robert E. Shostak,et al. Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.
[10] Jeffrey C. Lagarias,et al. The computational complexity of simultaneous Diophantine approximation problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[11] C. G. Nelson. An $n^{log n}$ algorithm for the two-variable-per-constraint linear programming satisfiability problem , 1978 .
[12] Samir Khuller,et al. The Lattice Structure of Flow in Planar Graphs , 1993, SIAM J. Discret. Math..
[13] A. F. Veinott. Representation of general and polyhedral subsemilattices and sublattices of product spaces , 1989 .
[14] Bengt Aspvall,et al. A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality , 1980, SIAM J. Comput..
[15] David K. Smith. Theory of Linear and Integer Programming , 1987 .