{"title":"连续时间网络中最大流量问题综述","authors":"Madan Bahadur Chand, T. N. Dhamala","doi":"10.3126/jacem.v7i01.47335","DOIUrl":null,"url":null,"abstract":"Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of the network flow problem is to find the maximum flow that can be sent from the source node to the destination node. Our aim is to review the general class of continuous time dynamic flow problems. We discuss about static cut and generalized dynamic cut, the latter one used to prove the maximum flow minimum cut theorem in continuous case.","PeriodicalId":306432,"journal":{"name":"Journal of Advanced College of Engineering and Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Brief Review on Maximum Flows in Networks with Continuous-Time Settings\",\"authors\":\"Madan Bahadur Chand, T. N. Dhamala\",\"doi\":\"10.3126/jacem.v7i01.47335\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of the network flow problem is to find the maximum flow that can be sent from the source node to the destination node. Our aim is to review the general class of continuous time dynamic flow problems. We discuss about static cut and generalized dynamic cut, the latter one used to prove the maximum flow minimum cut theorem in continuous case.\",\"PeriodicalId\":306432,\"journal\":{\"name\":\"Journal of Advanced College of Engineering and Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced College of Engineering and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3126/jacem.v7i01.47335\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced College of Engineering and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/jacem.v7i01.47335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Brief Review on Maximum Flows in Networks with Continuous-Time Settings
Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of the network flow problem is to find the maximum flow that can be sent from the source node to the destination node. Our aim is to review the general class of continuous time dynamic flow problems. We discuss about static cut and generalized dynamic cut, the latter one used to prove the maximum flow minimum cut theorem in continuous case.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
