共 50 条
- [41] Sample Complexity Bounds for RNNs with Application to Combinatorial Graph Problems (Student Abstract) THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 13745 - 13746
- [43] DECOMPOSITION METHOD OF SOLVING A CLASS OF COMBINATORIAL OPTIMIZATION PROBLEMS CYBERNETICS, 1983, 19 (06): : 833 - 837
- [44] Chaotic search method for a class of combinatorial optimization problems Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2001, 21 (05):
- [45] Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems 2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 19 - 20
- [47] On one class of symmetric optimization problems Kibernetika i Sistemnyj Analiz, 2001, (05): : 110 - 122
- [48] ONE SPECIAL CLASS OF OPTIMIZATION PROBLEMS DOKLADY AKADEMII NAUK SSSR, 1973, 212 (02): : 312 - 315
- [49] Models and algorithms for combinatorial optimization problems arising in railway applications 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2009, 7 (01): : 109 - 112
- [50] Parallel mean field algorithms for the solution of combinatorial optimization problems Proceedings of the International Conference on Artificial Neural Networks, 1991,