...
首页> 外文期刊>Computers & operations research >A comparison of two different formulations for arc routing problems on mixed graphs
【24h】

A comparison of two different formulations for arc routing problems on mixed graphs

机译:混合图上弧线布线问题的两种不同公式的比较

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

摘要

Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
机译:混合图上的弧线布线问题已在文献中建模,或者每个边缘仅使用一个变量,或者将两个变量与每个边缘相关联,每个变量代表其在相应方向上的遍历。在本文中,以混合一般路径问题为例,我们比较了两种公式的理论和计算结果,以及使用基于线性规划的方法从公式中获得的下界。进行了广泛的计算实验,包括一些大型的和新生成的随机实例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号