نتایج جستجو برای: fractional minimal cost flow problem
تعداد نتایج: 1810738 فیلتر نتایج به سال:
The pull-push hybrid P2P streaming, as an emerging and promising approach, has achieved some success in delivering live video traffic. The substream scheduling problem is a key design issue in a hybrid system. In this paper, we propose a max-flow model for unifying this sub-stream scheduling problem. We find that the sub-stream scheduling problem in GridMedia, CoolStreaming+ and LStreaming can ...
In this paper the method for the minimum cost flow determining in fuzzy dynamic network with nonzero lower flow bounds is proposed. Considered method takes into account fuzzy nature of networks’ parameters and deals with fuzzy arc flow bounds, fuzzy transmission costs. Fuzzy arc flow bounds, costs and transit times can vary depending on the flow departure time. The method allows introducing the...
Ravindra K. Ahuja and Dorit S. Hochbaum Abstract In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two dynamic lot sizing problems (with or without backorders) are minimum cost flow problems on an underlying network that possess a special structure. We show ...
Adler, I., A.J. Hoffman and R. Shamir, Monge and feasibility sequences in general flow problems, Discrete Applied Mathematics 44 (1993) 21-38. In a feasible transportation problem, there is always an ordering of the arcs such that greedily sending maximal flow on each arc in turn, according to that order, yields a feasible solution. We characterize those transportation graphs for which there ex...
In this article, the electro-osmotic flow of Oldroyd-B fluid in a circular micro-channel with slip boundary condition is considered. The corresponding fractional system is represented by using a newly defined time-fractional Caputo-Fabrizio derivative without singular kernel. Closed form solutions for the velocity field are acquired by means of Laplace and finite Hankel transforms. Additionally...
A multi-stage stochastic programming for condition-based maintenance with proportional hazards model
Condition-Based Maintenance (CBM) optimization using Proportional Hazards Model (PHM) is a kind of maintenance optimization problem in which inspections of a system relevant to its failure rate depending on the age and value of covariates are performed in time intervals. The general approach for constructing a CBM based on PHM for a system is to minimize a long run average cost per unit of time...
We present two efficient algorithms for solving the electric power transaction problem. The electric power transaction problem appears when maximizing the social benefit on electric power transactions among some private companies. The problem is a special case of the minimum cost flow problem defined on a network with many leaves, where each leaf corresponds to a (private) company who wants to ...
We consider the solution of matching problems with a convex cost function via a network flow algorithm. We review the general mapping between matching problems and flow problems on skew symmetric networks and revisit several results on optimality of network flows. We use these results to derive a balanced capacity scaling algorithm for matching problems with a linear cost function. The latter i...
In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید