Author:
Sumita Hanna,Kakimura Naonori,Makino Kazuhisa
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference26 articles.
1. Bouchet, A. (1992). A characterization of unimodular orientations of simple graphs. Journal of Combinatorial Theory, Series B, 56(1), 45–54.
2. Chandrasekaran, R. (1984). Integer programming problems for which a simple rounding type algorithm works. Progress in Combinatorial Optimization, 8, 101–106.
3. Chandrasekaran, R., Kabadi, S. N., & Sridhar, R. (1998). Integer solution for linear complementarity problem. Mathematics of Operations Research, 23(2), 390–402.
4. Chung, S. J. (1989). NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications, 60(3), 393–399.
5. Cook, W., Lovász, L., & Schrijver, A. (1984). A polynomial-time test for total dual integrality in fixed dimension (pp. 64–69). Berlin Heidelberg, Berlin, Heidelberg: Springer.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献