نتایج جستجو برای: network flow problem
تعداد نتایج: 1873348 فیلتر نتایج به سال:
In recent years, utilization of the renewable based power plants has become widespread in the power systems. One of the most widely used renewable based power plants is wind power plants. Due to the utilization of wind energy to generate electricity, wind turbines have not emitted any environmental pollution. Thus, in addition to economic benefits, utilization of these power plants is of great ...
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...
3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...
We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel mathematical program where the upper level consists in a firm that raises revenues from tolls set on arcs of the network, while the lower level is represented by a group of users travelling on shortest paths with respect to a generalized tr...
The theory of algebraic curves and quadrature domains is used to construct exact solutions to the problem of the squeeze flow of multiply-connected fluid domains in a Hele-Shaw cell. The solutions are exact in that they can be written down in terms of a finite set of time-evolving parameters. The method is very general and applies to fluid domains of any finite connectivity. By way of example, ...
3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید