[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$flsb9M8CyyDpNiNysWcDnBRkr5xFOVVxplxQLuODHL7c":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-06-11 14:30:51",145230261,[8,9,10,11],"最小耗费优先","深度优先","广度优先","最大效益优先",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},63,"6f87a5ff5cd17b2c84e275f58d563d47","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F07acaf5a4f53dc2678cc35bc7af98a07.jpg","计算机算法设计与分析","work_35150788","屋顶","下面不是分支界限法搜索方式的是( )",[21,33,40,50,60,70,78,87,92,98],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-06-26 18:52:16",145230243,[26,27,28,29],"采用FIFO队列的队列式分支限界法","采用最大值堆的优先队列式分支限界法","采用最小值堆的优先队列式分支限界法","以上都常用针对具体问题可以选择采用其中某种更为合适的方式","在分支限界算法中根据从活结点表中选择下一扩展结点的不同方式可有几种常用分类,以下( )描述最为准确","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":39,"source":31,"type":32},[],145230245,[37,9,38,10],"扩展结点优先","活结点优先","分支限界法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树",{"answer":41,"createTime":42,"id":43,"options":44,"question":49,"source":31,"type":32},[],"2024-06-12 22:44:47",145230247,[45,46,47,48],"分支限界法","回溯法","回溯法和分支限界法","回溯法求解子集树问题","在对问题的解空间树进行搜索的方法中一个活结点最多有一次机会成为活结点的是( )",{"answer":51,"createTime":52,"id":53,"options":54,"question":59,"source":31,"type":32},[],"2024-05-22 08:53:54",145230249,[55,56,57,58],"所有的","任意多个","二个","一个","分支限界法的搜索策略是:在扩展结点处,先生成其( )儿子结点(分支),然后再从当前的活结点表中选择下一个扩展对点.为了有效地选择下一扩展结点,以加速搜索的进程,在每一活结点处,计算一个函数值(限界),并根据这些已计算出的函数值,从当前活结点表中选择一个最有利的结点作为扩展结点,使搜索朝着解空间树上有最优解的分支推进,以便尽快地找出一个最优解",{"answer":61,"createTime":62,"id":63,"options":64,"question":69,"source":31,"type":32},[],"2024-06-12 20:45:50",145230251,[65,66,67,68],"先进先出队列","随机序列","最大堆或最小堆","后进先出的栈","优先队列的分支限界法将活结点表组织成一个优先队列,并按优先队列中规定的结点优先级选取优先级最高的下一个结点成为当前扩展结点.优先队列中规定的结点优先级常用一个与该结点相关的数值p来表示.结点优先级的高低与p值大小相关,根据问题的不同情况,采用( )来描述优先队列",{"answer":71,"createTime":23,"id":72,"options":73,"question":77,"source":31,"type":32},[],145230253,[46,74,75,76],"贪心法","分支界限法","动态规划法","最大效益优先是( )的搜索方式",{"answer":79,"createTime":23,"id":80,"options":81,"question":86,"source":31,"type":32},[],145230255,[82,83,84,85],"后进先出","先进先出","随机","结点的优先级","优先队列式分支限界法选取扩展结点的原则是( )",{"answer":88,"createTime":23,"id":89,"options":90,"question":91,"source":31,"type":32},[],145230257,[46,74,45,76],"下列算法中不能解决0\u002F1背包问题的是( )",{"answer":93,"createTime":62,"id":94,"options":95,"question":97,"source":31,"type":32},[],145230259,[47,96,45,46],"动态规划","在对问题的解空间树进行搜索的方法中一个活结点有多次机会成为活结点的是( )",{"answer":99,"createTime":5,"id":6,"options":100,"question":19,"source":31,"type":32},[],[8,9,10,11]]