[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fv39zUoZvdv-uvhdKllTLGYACvSQu1ZXRxS9dzctAbzE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":27,"type":43},[],"2024-05-21 22:39:08",12533072,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},11,"8c36d86523a1ef8315abef834177d525","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F51b9465b8dae539947fe44ef9610c2c3.jpg","算法分析与设计","2265b75037664057aa782df65299deca","","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为活结点的是( )",[17,29,38,44,47,52,58,63,72,77],{"answer":18,"createTime":19,"id":20,"options":21,"question":26,"source":27,"type":28},[],"2023-05-15 19:05:09",10418073,[22,23,24,25],"广度优先","活结点优先","扩展结点优先","深度优先","分支限界法在问题的解空间树中,按( )策略,从根结点出发搜索解空间树","v1",0,{"answer":30,"createTime":19,"id":31,"options":32,"question":37,"source":27,"type":28},[],10418074,[33,34,35,36],"广度优先分支限界法与深度优先分支限界法","队列式(FIFO)分支限界法与堆栈式分支限界法","排列树法与子集树法","队列式(FIFO)分支限界法与优先队列式分支限界法","常见的两种分支限界法为()",{"answer":39,"createTime":5,"id":40,"options":41,"question":42,"source":27,"type":43},[],12533071,[],"按照活结点表的组织方式的不同,分支限界法包括队列式(FIFO)分支限界法和()两种形式",2,{"answer":45,"createTime":5,"id":6,"options":46,"question":15,"source":27,"type":43},[],[],{"answer":48,"createTime":5,"id":49,"options":50,"question":51,"source":27,"type":43},[],12533073,[],"分支限界法解旅行售货员问题时,活结点表的组织形式是( )",{"answer":53,"createTime":54,"id":55,"options":56,"question":57,"source":27,"type":43},[],"2024-05-21 22:39:09",12533074,[],"最大效益优先是( )的一搜索方式",{"answer":59,"createTime":54,"id":60,"options":61,"question":62,"source":27,"type":43},[],12533075,[],"优先队列式分支限界法选取扩展结点的原则是( )",{"answer":64,"createTime":65,"id":66,"options":67,"question":70,"source":27,"type":71},[],"2023-05-16 08:51:11",12533076,[68,69],"正确","错误","深度优先不是分支限界法的搜索方式",3,{"answer":73,"createTime":65,"id":74,"options":75,"question":76,"source":27,"type":71},[],12533077,[68,69],"分支限界法只能应用于解决最优化问题",{"answer":78,"createTime":65,"id":79,"options":80,"question":81,"source":27,"type":71},[],12533078,[68,69],"将问题分支为子问题,采用广度优先产生状态空间树的结点,并使用剪枝函数对这些子问题限界而求解问题的方法称为分支限界法"]