نتایج جستجو برای: minimum cost flow problem
تعداد نتایج: 1761306 فیلتر نتایج به سال:
In this paper we broadly generalize the assignment auction algorithm to solve linear minimum cost network flow problems. We introduce a generic algorithm, which contains as special cases a number of known algorithms, including the e-relaxation method, and the auction algorithm for assignment and for transportation problems. The generic algorithm can serve as a broadly useful framework for the d...
This paper presents a new algorithm for identifying all the supported nondominated vectors (or outcomes) in the objective space, as well as the corresponding efficient solutions in the decision space, for the multi-objective integer network flow problem. Identifying the set of supported non-dominated vectors is of the utmost importance for obtaining a first approximation of the whole set of non...
This paper presents algorithms for the assignment problem, the transportation problem and the minimum cost flow problem of operations research. The algorithms find a minimum cost solution, but rtm in time close to the best-known bounds for the corresponding problems without costs. For example, the assignment problem (equivalently, minimum cost matching on a bipartite graph) can be solved in O(,...
An InSAR analysis approach for identifying and extracting the temporarily coherent points (TCP) that exist between two SAR acquisitions and for determining motions of the TCP is presented for applications such as ground settlement monitoring. TCP are identified based on the spatial characteristics of the range and azimuth offsets of coherent radar scatterers. A method for coregistering TCP base...
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characteris...
The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations,...
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 x becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. Here, we consider the capacity inver...
This paper describes the application of a dynamic programming approach to find minimum flow cost spanning trees on a network with general nonlinear arc costs. Thus, this problem is an extension of the Minimum Spanning Tree (MST) problem since we also consider flows that must be routed in order to satisfy user needs. In fact, the MST, usually, considers fixed arc costs and in our case the arc co...
Cell suppression is one method that is commonly used to reduce disclosure risk when data are published in hierarchical tables. A form of optimality is achieved for 2-dimensional tables by formulating the cell suppression problem as a minimum cost flow problem. There are issues with this approach in general, and for its application to 3-dimensional tables in particular. First, cell suppression i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید