共 50 条
- [2] Multiple QoS Constraints Finding Paths Algorithm in TMN INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2011, 14 (03): : 731 - 737
- [5] A *Prune: An algorithm for finding K shortest paths subject to multiple constraints IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 743 - 749
- [7] COMPUTATIONAL STRUCTURES OF ALGORITHMS FOR FINDING PATHS IN A GRAPH SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1985, 23 (03): : 1 - 7
- [9] Efficient algorithms for finding disjoint paths in grids PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 454 - 463
- [10] Adaptive mirror descent algorithms in convex programming problems with Lipschitz constraints. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2018, 24 (02): : 266 - 279