首页> 外文期刊>Computers & mathematics with applications >A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
【24h】

A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

机译:解决NP难组合问题的动态规划方法的图形实现

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the corresponding problem. We compare the proposed method with existing algorithms for these problems on small-size instances of the partition problem with n ≤ 10 numbers. For almost all instances, the new algorithm considers on average substantially less "stages" than the dynamic programming algorithm.
机译:在本文中,我们考虑了动态编程的图形化实现。讨论了有关分区和背包问题的概念。与动态编程相反,新算法还可以处理具有非整数数据的问题,而无需对相应问题进行必要的转换。对于n≤10的分区问题的小实例,我们将提出的方法与现有算法进行比较。对于几乎所有情况,新算法平均考虑的“阶段”要比动态编程算法少得多。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号