Location:
Search - 优先队列式分支限界法
Search list
Description: 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
Platform: |
Size: 17167 |
Author: 老七 |
Hits:
Description: 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。
Platform: |
Size: 5468 |
Author: Jacky Gao |
Hits:
Description: 解决旅行售货员问题的优先队列式分支限界法C++源程序
Platform: |
Size: 2376 |
Author: key4lock |
Hits:
Description: 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
Platform: |
Size: 17408 |
Author: 老七 |
Hits:
Description: 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。-Undirected graph of the largest cut: For a given undirected graph G, the design of a priority queue-type branch and bound method to calculate G, the largest cut.
Platform: |
Size: 5120 |
Author: Jacky Gao |
Hits:
Description: 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data used in data
Platform: |
Size: 264192 |
Author: 刘斌 |
Hits:
Description: 羽毛球队有男女运动员各n 人。给定2 个n×n 矩阵P 和Q。P[i][j] 是男运动员i 和女运动员j 配对组成混合双打的男运动员竞赛优势；Q[i][j] 是女运动员i和男运动员j 配合的女运动员竞赛优势。由于技术配合和心理状态等各种因素影响，P[i][j]不一定等于Q[j][i]。男运动员i 和女运动员j 配对组成混合双打的男女双方竞赛优势为P[i][j]*Q[j][i] 。设计一个算法,计算男女运动员最佳配对法， 使各组男女双方竞赛优势的总和达到最大。
算法设计：
设计一个优先队列式分支限界法，对于给定的男女运动员竞赛优势，计算男女运动员最佳配对法， 使各组男女双方竞赛优势的总和达到最大。
数据输入：
第一行有1 个正整数n (1≤n≤20)。接下来的2n 行，每行n 个数。前n 行是p，后n 行是q。
结果输出:
将计算出的男女双方竞赛优势的总和的最大值
-asdf lkjadsf lkjadfkljadsffda
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 世界名画陈列馆由nm × 个排列成矩形阵列的陈列室组成。为了防止名画被盗， 需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4 个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最少。
算法设计：
设计一个优先队列式分支限界法，计算警卫机器人的最佳哨位安排，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最少。
数据输入：
第一行有2 个正整数m和n (1≤m,n≤20)。
结果输出:
第一行是警卫机器人数；接下来的m行中每行n个数，0 表示无哨位，1 表示哨位。
例如：输入
4 4
输出
4
0 0 1 0
1 0 0 0
0 0 0 1
0 1-Famous paintings gallery arranged by the nm × a rectangular array of showroom component. In order to prevent the paintings stolen, you need to set the security robot sentinel showroom. Each robot in addition to monitoring its security in the showroom, but also can monitor it in the showroom and the adjacent, down, left and right four showrooms. Try to design a robot sentinel security arrangements for the algorithm, makes the paintings galleries in every showroom are under surveillance by security robots, and robots used in the least number of guards.
Algorithm Design:
Design a priority queue-type branch and bound method to calculate the best robot sentinel security arrangements, making paintings in each gallery showroom are under surveillance by security robots, and robots used in the least number of guards.
Data entry:
The first line has two positive integers m and n (1 ≤ m, n ≤ 20).
The resulting output:
The first line is the number of security robots the next m rows in
Platform: |
Size: 885760 |
Author: wakaka |
Hits:
Description: 解决旅行售货员问题的优先队列式分支限界法-Solve the traveling salesman problem of the priority queue-type branch and bound
Platform: |
Size: 2048 |
Author: CGQ |
Hits:
Description: 对任意给定的整数N和K，以及完成任务I需要的时间为Ti，i=1至N设计一个优先队列式分支限界法，计算完成这N个任务的最佳调度-Batch scheduling problem
Platform: |
Size: 3072 |
Author: hmy |
Hits:
Description: 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
Platform: |
Size: 1024 |
Author: 丫丫 |
Hits:
Description: 实验要求：请在下图所给出电路板中，按布线要求，利用队列式或优先队列分支限界法实现从a到b的布线工作
-Experimental requirements: On the graph below given circuit board, wiring requirements, queue or priority queue branch and bound method to achieve the wiring from a to b
Platform: |
Size: 225280 |
Author: x |
Hits:
Description: 王晓东《算法设计与分析》第三节装载问题优先队列式分支限界法求解-Xiaodong " algorithm design and analysis" problem loading priority queue type III branch and bound method to solve
Platform: |
Size: 3072 |
Author: 王栋 |
Hits: