توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
نویسنده(ها): ،
اطلاعات انتشار: Iranian Journal Of Operations Research، پنجم،شماره۲، ۲۰۱۴، سال
تعداد صفحات: ۱۴
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capacity inverse problem under the bottleneck–type and the sum–type weighted Hamming distances. In the bottleneck–type case, the binary search technique is applied to present an algorithm for solving the problem in O(nm log n) time. In the sum–type case, it is shown that the inverse problem is strongly NP–hard even on bipartite networks
نمایش نتایج ۱ تا ۱ از میان ۱ نتیجه