使用可用的库求解最小组合封面

可以使用以下命令进行安装:pip install dlx或easy_install dlx I would like to solve an instance of minimum set cover. As one possibility, is there some way of formulating the problem as a bipartite graph and using networkx?Update Using dlx (dancing links) was suggested in the comments. Can anyone give a small working example of how to solve the minimum set cover problem using dlx? 解决方案 Set cover can be mapped to any NP-complete problem on a graph, but that doesn't mean you'll be able to solve it efficiently. Is there a reason you don't focus directly on the problem at hand (ie, set cover)? Maybe something like: https://pypi.org/project/dlx/ This can be installed using: pip install dlx or easy_install dlx 这篇关于使用可用的库求解最小组合封面的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！