scholarly journals Optimal compromise solution of multi-objective minimal cost flow problems in fuzzy environment

2013 ◽  
Vol 37 (4) ◽  
pp. 1677-1693 ◽  
Author(s):  
Manjot Kaur ◽  
Amit Kumar
Keyword(s):  
Compromise Solution ◽  
Minimal Cost ◽  
Multi Objective ◽  
Flow Problems ◽  
Fuzzy Environment ◽  
Cost Flow ◽  
Minimal Cost Flow

Two new algorithms for minimal cost flow problems

Computing ◽  
1973 ◽  
Vol 11 (3) ◽  
pp. 275-285 ◽  
Author(s):  
W. Domschke
Keyword(s):  
Minimal Cost ◽  
Flow Problems ◽  
Cost Flow ◽  
New Algorithms ◽  
Minimal Cost Flow

scholarly journals Maximal concurrent minimal cost flow problems on extended multi-cost multi-commodity networks

2021 ◽  
pp. 29-35
Author(s):  
Ho Van Hung, Tran Quoc Chien Ho
Keyword(s):  
Optimization Problems ◽  
Mathematical Tool ◽  
Minimal Cost ◽  
Concurrent Flow ◽  
Flow Problems ◽  
Multiple Weights ◽  
Cost Flow ◽  
Approximate Procedure ◽  
Minimal Cost Flow

The graph is a great mathematical tool, which has been effectively applied to many fields such as economy, informatics, communication, transportation, etc. It can be seen that in an ordinary graph the weights of edges and vertexes are taken into account independently where the length of a path is the sum of weights of the edges and the vertexes on this path. Nevertheless, in many practical problems, weights at vertexes are not equal for all paths going through these vertexes, but are depending on coming and leaving edges. Moreover, on a network, the capacities of edges and vertexes are shared by many goods with different costs. Therefore, it is necessary to study networks with multiple weights. Models of extended multi-cost multi-commodity networks can be applied to modelize many practical problems more exactly and effectively. The presented article studies the maximal concurrent minimal cost flow problems on multi-cost and multi-commodity networks, which are modelized as optimization problems. On the base of the algorithm to find maximal concurrent flow and the algorithm to find maximal concurrent limited cost flow, an effective polynomial approximate procedure is developed to find a good solution.

Two-dimensional phase unwrapping integrating deep learning and minimal cost flow

2021 ◽  
Author(s):  
Zhipeng Wu ◽  
Teng Wang ◽  
Yingjie Wang ◽  
Daqing Ge
Keyword(s):  
Deep Learning ◽  
Atmospheric Turbulence ◽  
Deformation Monitoring ◽  
Phase Unwrapping ◽  
Minimal Cost ◽  
Localized Deformation ◽  
Flow Solver ◽  
Training Samples ◽  
Cost Flow ◽  
Minimal Cost Flow

<p>InSAR can measure surface deformation in all-weather conditions and has been widely used to study landslides, land subsidence, and many geophysical processes. Since the phase of radar echo is measured in 2π rad modulo (wrapped), phase unwrapping is an indispensable step for InSAR, and its reliability directly determines the feasibility of deformation monitoring. However, temporal and spatial decorrelation often leads to severe noises, localized deformation or strong atmospheric turbulence may result in dense fringes, both making traditional unwrapping methods fail in acquiring continual unwrapped phases. Here, we present a deep convolutional neural network (DENet) to identify the probability of phase discontinuities between every two adjacent pixels in the interferogram and apply the probability as cost in the widely-used minimal cost flow solver to achieve phase unwrapping. To train the network effectively, we design a simulation strategy to generate sufficient training samples: the terrain-related phases are used as the background phases, and the deformation phases, atmospheric turbulence phases, and noises are superimposed to build the training samples. Unlike classical methods such as GAMMA and SNAPHU that use the coherence map as the quality index, we use the probability of phase discontinuities estimated by the DENet as the arc-cost of the minimum cost flow problem. We apply the proposed method to unwrap simulated and real interferograms and compare the results with 8 existing methods (including traditional and deep learning-based ones).  On the simulated data set, the root-mean-square error (RMSE) of the proposed method is lower than all the 8 existing methods. We also test different methods to unwrap the real Sentinel-1 interferograms and verified the reliability using ALOS-2 data with a nearly identical acquisition period. Our results show strong robustness and stability when unwrapping very large interferograms with complicated phase patterns. The proposed method takes advantages of both deep learning and traditional minimal cost flow solver, which can effectively unwrap interferograms with low coherence and/or dense fringes, providing strong potential for large-scale SAR interferometry applications.</p>

Sign in / Sign up

Export Citation Format

Share Document