نتایج جستجو برای: minimum flow
تعداد نتایج: 638710 فیلتر نتایج به سال:
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...
We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given an amount of flow F , find the minimum time needed to send it from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditions for the quickest flow problem. Based on the optimality conditions, we develop a new costscal...
In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference list consists of all papers known to the authors which deal with the multiple objective minimum cos...
Given a generalized network and a generalized feasible flow f, we consider a problem finding a modified edge cost d such that f is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem and minimum mean circuit problems and analyze a binary search algorithm for this problem.
We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given a flow F , find the minimum time needed to send F from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditions for the quickest flow problem. Based on the optimality conditions, we develop a new cost-scaling algorit...
Let N be a single-source single-sink ow network with n nodes, m arcs, and positive arc costs. We present a pseudo-polynomial algorithm that computes a maximum ow of minimum cost for N in time O(3=4 m p log n), where is the cost of the ow. This improves upon previously known methods for networks where the minimum cost of the ow is small. We also show an application of our ow algorithm to a well-...
As network science has matured as an established field of research, there are already a number of courses on this topic developed and offered at various higher education institutions, often at postgraduate levels. In those courses, instructors adopted different approaches with different focus areas and curricular designs. We collected information about 30 existing network science courses from v...
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 investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. This problem can, e.g., be seen as the application of the ε-constraint method to the bicriteria minim...
For a simple bipartite graph and an integer t ≥ 2, we consider the problem of finding a minimum-weight t-factor under the restriction that it contains no complete bipartite graph Kt,t as a subgraph. When t = 2, this problem amounts to the minimum-weight square-free 2-factor problem in a bipartite graph, which is NP-hard. We propose, however, a strongly polynomial algorithm for a certain case wh...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید