期刊文献+

Inverse Generalized Minimum Cost Flow Problem Under the Hamming Distances

原文传递
导出
摘要 Given a generalized minimum cost flow problem,the corresponding inverse problem is to find a minimal adjustment of the cost function so that the given generalized flow becomes optimal to the problem.In this paper,we consider both types of the weighted Hamming distances for measuring the adjustment.In the sum-type case,it is shown that the inverse problem is APX-hard.In the bottleneck-type case,we present a polynomial time algorithm.
出处 《Journal of the Operations Research Society of China》 EI CSCD 2019年第2期355-364,共10页 中国运筹学会会刊(英文)
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部