Author:
Blokh David,Levner Eugene
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. Two algorithmic results for the traveling salesman problem;Barvinok;Math. Oper. Res.,1996
2. A. Barvinok, D.S. Johnson, G.J. Woeginger, R. Woodroofe, The maximum traveling salesman problem under polyhedral norms, in: R.E. Bixby, E.A. Boyd, R.Z. Rioz-Mercado (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of IPCO-VI, Lecture Notes in Computer Science, Vol. 1412, 1998, pp. 195–201.
3. Assignment problem for three-index Jacobi matrices;Blokh;Automat. Remote Control,1989
4. Maximizing traveling salesman problem for special matrices;Blokh;Discrete Appl. Math.,1995
5. D. Blokh, E. Levner, The maximum traveling salesman problem on banded matrices, Internat. J. Foundations Comput. Sci. (to appear).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献