Search - branch and bound java

Search - branch and bound java - List

[Other] LCbb_TSP DL : 0: LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman- code
Update : 2025-02-17 Size : 58kb Publisher : 张强
[GUI Develop] HuoLangDanProblem DL : 0: 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
Update : 2025-02-17 Size : 16kb Publisher : EllenGong
[Other] tsp.c DL : 0: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
Update : 2025-02-17 Size : 3kb Publisher : 郎风华
[JSP/Java] stamp DL : 0: 连续邮资问题,采用分支限界法编写,java实现-Postage consecutive issues, the use of branch and bound method to prepare, java realize
Update : 2025-02-17 Size : 3kb Publisher : zhanghan
[Data structs] suanfa DL : 0: 第1章算法引论第2章递归与分治策略第3章动态规划第4章贪心算法第5章回溯法第6章分支限界法 -Chapter 1 Introduction Algorithm Chapter 2 Recursion and sub-rule strategy in Chapter 3 Dynamic Programming Chapter 4 greedy algorithm in Chapter 5 Backtracking Chapter 6 branch and bound method
Update : 2025-02-17 Size : 3.17mb Publisher : jake
[JSP/Java] shortest-way-java DL : 0: 分支限界法单源最短路径问题的 JAVA实现 3个源文件-Branch and bound method single-source shortest path problem JAVA realization of 3 source files
Update : 2025-02-17 Size : 3kb Publisher : 鲁文炳
[Data structs] shortestpaths DL : 0: 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
Update : 2025-02-17 Size : 2kb Publisher : fzb
[JSP/Java] SimpMethodProj DL : 0: [数学问题]用分支定界发解线性混合整数规划问题，JavaSE swing 界面。-[Mathematical problem] Used branch and bound solution fat LMIP problem, JavaSE swing GUI.
Update : 2025-02-17 Size : 38kb Publisher : sea-0108
[JSP/Java] Knapsack DL : 0: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Update : 2025-02-17 Size : 2kb Publisher : L
[JSP/Java] TravellingSalesman DL : 0: TSP Problem In Java .. it is not a complete code but it will give you a picture for that
Update : 2025-02-17 Size : 2kb Publisher : ahmad
[Windows Develop] lvxingshouhuoyuan DL : 0: 旅行售货员问题的java版本，采用分支限界法。有详细解释-Traveling salesman problem is the java version, using branch and bound. Explained in detail
Update : 2025-02-17 Size : 3kb Publisher : 崔雅珍
[JSP/Java] main DL : 0: 分支限界法实现旅行售货员问题，使用时间挺短的，代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code
Update : 2025-02-17 Size : 1kb Publisher : 冯
[JSP/Java] 0_1Knasack DL : 0: 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
Update : 2025-02-17 Size : 208kb Publisher : 谢斌
[Data structs] traveler DL : 0: 旅行商问题的分支限界法经典算法的JAVA实现-Traveling Salesman Problem classical branch and bound algorithm to achieve JAVA
Update : 2025-02-17 Size : 187kb Publisher : 李鑫
[Data structs] Algorithms.Design-Michael.T.Goodrich DL : 0: 本书系统地阐述了算法设计的方法、技术和应用实例。全书内容包括基础算法、基本数据结构、基本算法设计技术、图算法、网络流和匹配、文本处理算法、数论算法、网络算法、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
Update : 2025-02-17 Size : 8.24mb Publisher : wb
[Data structs] AlgorithmAnalysisaDesign DL : 0: 本书系统地阐述了算法设计的方法、技术和应用实例。全书内容包括基础算法、基本数据结构、基本算法设计技术、图算法、网络流和匹配、文本处理算法、数论算法、网络算法、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
Update : 2025-02-17 Size : 8.24mb Publisher : w_jmos
[Data structs] shortestPath DL : 1: 用Java语言实现的用分支限界法解决单源最短路径问题的算法-An implementation of single source shortest path problem with Java language based on branch and bound method
Update : 2025-02-17 Size : 88kb Publisher : gladnews
[JSP/Java] Knapsack DL : 0: 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorithms and data structures
Update : 2025-02-17 Size : 2kb Publisher : xuchao
[Other] 旅行商 DL : 0: 利用分支界限算法实现旅行销售商问题的分支限界算法(Branch and bound algorithm for the traveling salesperson problem)
Update : 2025-02-17 Size : 3kb Publisher : SDQWDWQ