Linear Complementarity as a General Solution Method to Combinatorial Problems

References

• Berman A., Plemmons R. J.Nonnegative Matrices in the Mathematical Sciences (1979) (Academic Press, New York) Google Scholar
• Cottle R. E., Pang J.-S., Stone R. E.The Linear Complementarity Problem (1992) (Academic Press, New York) Google Scholar
• Curry H. B.Foundations of Mathematical Logic (1963) (McGraw-Hill, New York) Google Scholar
• Dalgaard P.Introductory Statistics with R (2002) (Springer-Verlag, Berlin, Germany) Google Scholar
• Dongarra J. J. Performance of various computers using stand-ard linear equations software. (2004) . Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301; Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 27831Google Scholar
• Giannessi F., Nicolucci F. Connections between nonlinear and integer programming problems. Istituto Nazionale di Alta Matematica. Symposia Mathematica (1976) XIX(Academic Press, New York) Google Scholar
• Hintikka K. J. J. Form and content in quantification theory. Acta Philosophica Fennica (1955) 8:7–55Google Scholar
• Hochbaum D. S.Approximation Algorithms for NP-Hard Problems (1997) (International PWS Publ. Co., Boston, MA) Google Scholar
• Kendall M., Stuart A.The Advanced Theory of Statistics (1958) 1(Griffin, London, UK) Google Scholar
• Mayer J., Mittereiter I., Radermacher F. J. Running time experiments on some algorithms for solving propositional satisfiability problems. Ann. Oper. Res. (1995) 55:139–178Crossref, Google Scholar
• Mercuri M. Soluzioni di problemi di localizzazione dei servizi di emergenza in situazioni aleatorie e dinamiche. (1992) . Tesi di Laurea, Facoltà di Scienze Statistiche, Demografiche ed Attuariali, Universitá di Roma “La Sapienza,” Rome, ItalyGoogle Scholar
• Mirchandani P. B. The M median problem. Eur. J. Oper. Res. (1985) 21:121–137Crossref, Google Scholar
• Mitchell J. E., Todd M. J. Solving combinatorial problems using Karmarkar’s algorithm. Math. Programming (1992) 56:245–284Crossref, Google Scholar
• Murty K. J. On the number of solutions to the complementarity problem and spanning properties of complementary cones. Linear Algebra Its Appl. (1972) 5:65–108Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Patrizi G. The equivalence of an LCP to a parametric linear program with a scalar parameter. Eur. J. Oper. Res. (1991) 51:367–386Crossref, Google Scholar
• Rinnooy Kan A. H. G. An introduction to the analysis of approximation algorithms. Discrete Appl. Math. (1986) 14:111–134Google Scholar
• Torregas C., Swain R., Revelle C., Bergman L. The location of emergency service facilities. Oper. Res. (1971) 19:1363–1373Link, Google Scholar