Optimum Flows in Directed Planar Dynamic Networks. The Dynamic Approch
| dc.contributor.author | Camelia Schiopu | |
| dc.contributor.author | Eleonor Ciurea | |
| dc.date.accessioned | 2025-09-11T18:35:05Z | |
| dc.date.issued | 2025-01-03 | |
| dc.description.abstract | Optimum flows in directed planar dynamic networks are essential for several reasons, impacting a varietyof fields. These networks present unique challenges that require advanced optimization techniques to ensure efficient andreliable performance. In this paper we consider a time-varying directed planar network without parallel arcs and loops,where a flow must take a certain time to traverse an arc. The problem is to find an optimal (minimal or maximal) solutionto send the optimum (minimum or maximum) flow from the source node to the sink node, within a given timeT. | |
| dc.identifier.citation | Schiopu C, Ciurea E. Optimum Flows in Directed Planar Dynamic Networks. The Dynamic Approch. Contemp. Math. [Internet]. 2025 Jan. 3 [cited 2025 Sep. 12];6(1):146-61. | |
| dc.identifier.issn | 2705-1064 | |
| dc.identifier.uri | https://repository.unitbv.ro/handle/123456789/919 | |
| dc.language.iso | en | |
| dc.publisher | Universal Wisher Publisher | |
| dc.subject | minimum flow | |
| dc.subject | maximum flow | |
| dc.subject | static network | |
| dc.subject | dynamic network | |
| dc.title | Optimum Flows in Directed Planar Dynamic Networks. The Dynamic Approch | |
| dc.type | Article |