Location:
Search - branch bound t
Search list
Description: 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code
Platform: |
Size: 2048 |
Author: 罗兰 |
Hits:
Description: A branch-and-bound algorithm for asymmetric TSP
Platform: |
Size: 14336 |
Author: foxman |
Hits:
Description: 分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm
Platform: |
Size: 1024 |
Author: shangxiaobing |
Hits:
Description: 本书系统地阐述了算法设计的方法、技术和应用实例。全书内容包括基础算法、基本数据结构、基本算法设计技术、图算法、网络流和匹配、文本处理算法、数论算法、网络算法、NP完全性、近似算法、回溯法和分枝限界法、外存算法、并行算法和在线算法。Java实现示例覆盖了软件设计方法、面向对象实现问题和算法的实验性分析。这些典型问题的Java应用示例分布在不同的章节中。此外，书中以大量图例说明算法的工作过程，使算法更加易于理解和掌握。 本书适合作为高等院校计算机专业本科生和研究生算法设计课程的教材，也可作为从事软件开发和工程设计的专业人员的参考书。此外，算法爱好者和参加各种程序设计大赛的选手也可把本书作为参考用书。-The book systematically elaborated algorithm design methodologies, techniques and application examples. The book covers basic algorithms, basic data structures, basic algorithm design techniques, graph algorithms, network flow and matching, text processing algorithms, number theoretic algorithms, network algorithms, NP complete, approximation algorithm, backtracking and branch and bound method, the external memory algorithms, parallel algorithms and online algorithms. Java implementation of the sample covers software design methods, object-oriented realization of the experimental analysis of problems and algorithms. These typical Java application examples are distributed in different sections. In addition, the book shows a large number of legends of the working process of the algorithm, the algorithm easier to understand and master. The book is suitable as institutions of higher learning computer professional undergraduate and graduate students algorithm design courses, textbooks, refe
Platform: |
Size: 8637440 |
Author: wb |
Hits: