S. Cabay
- 1 BAREISS, E.H. Computational solutions of matrix problems over an integral domain. Y. Inst. Math. Applic. 10 (1972), 68-104.Google Scholar
- 2 BORODIN, A., AND MUNRO, I. The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York, 1975.Google Scholar
- 3 BROWN, W.S. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. A CM 18, 4 (Oct. 1971), 478--504. Google Scholar
- 4 CABAY, S. Exact solution of linear equations. Proc. Second Syrup. on Symbolic and Algebraic Manipulation, ACM, New York, 1971, pp. 392-398. Google Scholar
- 5 CABAY, S., AND LAM, T.P.L. Algorithm 523, ESOLVE: Congruence techniques for the exact solution of integer systems of linear equations, ACM Trans. Ma~h. Software ~, 4 (Dec. 1977), 404410. Google Scholar
- 6 CHARMONMAN, S., AND WAGENER, J.L. On structured programming in FORTRAN. SIGNUM Newsletter (ACM) 10, 1 (Jan. 1975), 21-23. Google Scholar
- 7 GENTLEMAN, W.M., AND JOHNSON, S.C. Analysis of algorithms, a case study: Determinants of polynomials. Proc. Fifth Annual ACM Syrup. on Theory of Computing, 1973, pp. 135-141. Google Scholar
- 8 (}RIss, M.L. The algebraic solution of sparse linear systems via minor expansion. ACM Trans. Math. Software Z, 1 (March 1976), 31--49. Google Scholar
- 9 HOROWITZ, E., AND SAHSt, S. On computing the exact determinant of matrices with polynomial entries. J. ACM ~2, 1 (jan. 1975), 38-50. Google Scholar
- 10 HOWELL, J. Algorithm 406" Exact solution of linear equations using residue arithmetic. Comm. ACM 1~, 3 (March 1971), 180--184. Google Scholar
- 11 HULL, T.E. Would you believe structured Fortran?. SIGNUM Newsletter (ACM) 8, 4 (Oct. 1973), 13-16. Google Scholar
- 12 KNUTH, D.E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1969. Google Scholar
- 13 MAZUKELLI, D. Multistep elimination over commutative rings. Ph.D. Th., Dept. of Math., Northwestern U., Evanston, Ill., 1972.Google Scholar
- 14 MCCLELLAN, M.T. The exact solution of systems of linear equations with polynomial coefficients. J. ACM Z0, 4 (Oct. 1973), 563-588. Google Scholar
- 15 McCLELLAN, M.T. A comparison of algorithms for the exact solution of linear equations. To appear in A CM Trans. Math. Software. Google Scholar
- 16 MCCLET.LAN, M.T. The exact solution of linear equations with rational function coefficients. To appear in ACM Trans. Math. Software. Google Scholar
- 17 SCHbNHAO~, A. Schnelle Berechnung yon Kettenbruchentwicklungen. Acta Inforrnatica I (1971), 139-144.Google Scholar
- 18 SHAPIRO, G. Gauss elimination for singular matrices. Math. Comput. 17 (1963), 441-445.Google Scholar
- 19 YUN, D.Y.Y. The Hensel lemma in symbolic manipulation. Ph.D. Th., Dept. of Math., M.I.T., Cambridge, Mass., 1973.Google Scholar
Index Terms
- Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
Recommendations
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method
In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes of nonlinear integer programming problems: separable nonlinear integer programming and polynomial zero-one programming. The ...
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
We propose a solution approach for the general problem (QP) of minimizing a quadratic function of bounded integer variables subject to a set of quadratic constraints. The resolution is based on the reformulation of the original problem (QP) into an ...
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) problem by first reformulating a QP as a linear complementary problem, and then using binary variables and big-M constraints to model its complementary ...
Comments