论文信息 - Flow Tasks Solving in Dynamic Networks with Fuzzy Lower, Upper Flow Bounds and Transmission Costs

Flow Tasks Solving in Dynamic Networks with Fuzzy Lower, Upper Flow Bounds and Transmission Costs

Tasks, considered in the first chapter of the present book, assume instant flow transition along the arcs of the graph. The present paper deals with dynamic networks, i.e. such a networks, in which flow spends certain time passing along the arcs of the graph.

Janusz Kacprzyk | Igor Rozenberg | Alexander Bozhenyuk | Evgeniya Gerasimenko

[1] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[2] Dmitrii Lozovanu,et al. Optimal flow in dynamic networks with nonlinear cost functions on edges , 2002, Analysis and Optimization of Differential Systems.

[3] Balachandran Vaidyanathan,et al. Minimum Cost Flows , 2011 .

[4] Alexander V. Bozhenyuk,et al. Flows Finding in Networks in Fuzzy Conditions , 2014, Supply Chain Management Under Fuzziness.

[5] Elise Miller-Hooks,et al. On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks , 2004, J. Math. Model. Algorithms.

[6] Alexander Bozhenyuk,et al. Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks , 2013 .

[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8] Alexander V. Bozhenyuk,et al. Method for the minimum cost maximum flow determining in fuzzy dynamic network with nonzero flow bounds , 2015, IFSA-EUSFLAT.

[9] N. Tomizawa,et al. On some techniques useful for solution of transportation network problems , 1971, Networks.

[10] Ismail Chabini,et al. The Minimum Cost Flow Problem in Capacitated Dynamic Networks , 2003 .