Reverse maximum flow problem under the Chebyshev distance
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 440
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS10_063
تاریخ نمایه سازی: 11 شهریور 1397
Abstract:
Given a network G(V,A,u) with two specific nodes, a source nods s and a sink node t, the reverse maximum flow problem is to increase the capacity of some arcs (I,j) as little as possible so that the maximum flow value from s to in the modified network is lower is lower bounded by a prescribed value v(0) . in this paper, we study the reverse maximum flow problem under the chebyshev distance and present an efficient alogrithm to solve the problem.
Keywords:
Authors
Javad Tayyebi
department of industrial Engineering, birjand university of technology, biriand, irqn
Seyyed Mohammad reza kazemi
department of industrial engineering, birjand university of technology, birjand, iran