Integer Solution for Linear Complementarity Problem

References

• Bouchet A. A characterization of unimodular orientations of simple graphs. J. Combin. Theory (1992) B56:45–54Crossref, Google Scholar
• Chandrasekaran R. A special case of the complementary pivot problem. Opsearch (1970) 7:263–268Google Scholar
• Chandrasekaran R., Pulleyblank W. R. Integer programming problems for which a simple rounding-type algorithm works. Progress in Combinatorial Optimization (1984) (Academic Press, New York) 101–106Google Scholar
• Chandrasekaran R., Kabadi S. N. Strongly polynomial algorithms for a class of combinatorial LCP's. Oper. Res. Lett. (1987) 1(2):91–92Crossref, Google Scholar
• Chandrasekaran R., Kabadi S. N., Sridhar R.Integer solution for linear complementarity problem (1995) . Working paper #95-031, Faculty of Administration, University of New Brunswick, Fredericton, CanadaGoogle Scholar
• Cottle R. W., Pang J. S., Stone R. E.The Linear Complementarity Problem (1992) (Academic Press, Inc., New York) Google Scholar
• Cottle R. W., Pang J. S., Venkateswaran V. Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. (1989) 114/115:213–249Crossref, Google Scholar
• Cunningham W., Geelen J. F.Integral solutions of linear complementarity problems (1996) . Working paper, Department of Combinatorics and Optimization, University of WaterlooGoogle Scholar
• Du Val P. The unloading problem for plane curves. Amer. J. Math. (1940) 18:307–311Crossref, Google Scholar
• Eaves B. C. The linear complementarity problem. Management Sci. (1971) 17:698–711Link, Google Scholar
• Kojima M., Saigal R. On the number of solutions to a class of complementarity problems. Math. Programming (1979) 17:136–139Crossref, Google Scholar
• Mohan S. R., Parthasarathy T., Sridhar R. The linear complementarity problem with exact order matrices. Math. Oper. Res. (1994) 19:618–644Link, Google Scholar
• Mohan S. R., Sridhar R. On characterising N-matrices using linear complementarity. Linear Algebra Appl. (1992) 160:231–245Crossref, Google Scholar
• Murty K. G.Linear Complementarity, Linear and Nonlinear Programming (1988) (Heldermann-Verlag, West Berlin) Google Scholar
• Murty K. G.Linear Programming (1983) (John Wiley and Sons, New York) Google Scholar
• Olech C., Parthasarathy T., Ravindran G. A class of globally univalent differentiable mappings. Archivun Mathematicum (Brno) (1989) 26:165–172Google Scholar
• Olech C., Parthasarathy T., Ravindran G. Almost N-matrices and its applications to linear complementarity problem and global univalence. Linear Algebra Appl. (1991) 145:107–125Crossref, Google Scholar
• Pardalos P. M., Gomez S., Hennart J. P. The linear complementarity problem. Advances in Optimization and Numerical Analysis (1994) (Kluwer Academic Publishers)39–49Crossref, Google Scholar
• Pardalos P. M., Dil Pillo G., Giannessi F. Continuous approaches to discrete optimization problems. Nonlinear Optimization and Applications (1996) (Plenum Publishing, New York) Google Scholar
• Pardalos P. M., Nagurney A. The integer complementarity problem. Internat. J. Comput. Math. (1990) 31:205–214Crossref, Google Scholar
• Pardalos P. M., Rosen J. B. Global optimization approach to the linear complementarity problem. SIAM J. Sci. Statist. Comput. (1988) 9(2):205–214Crossref, Google Scholar
• Parthasarathy T., Ravindran G. N-matrices. Linear Algebra Appl. (1990) 139:89–102Crossref, Google Scholar
• Seymour P. D. Decomposition of regular matroids. J. Combin. Theory (1980) B 28:305–359Crossref, Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (John Wiley & Sons, Toronto) Google Scholar
• Truemper K. A decomposition theory of matroids. V. Testing for matrix total unimodularity. J. Combin. Theory (1990) B 49:241–281Crossref, Google Scholar