平面网络中的逆最大流问题

Q4 Mathematics

Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-30 DOI:10.31926/but.mif.2019.12.61.1.10

L. Ciupala, Romania Brasov, A. Deaconu

{"title":"平面网络中的逆最大流问题","authors":"L. Ciupala, Romania Brasov, A. Deaconu","doi":"10.31926/but.mif.2019.12.61.1.10","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of inverse maximum flow in planar network (IMFPN), where upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a maximum flow in the modified network. A strongly polynomial algorithm for solving this problem is proposed. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Inverse maximum flow problem in planar networks\",\"authors\":\"L. Ciupala, Romania Brasov, A. Deaconu\",\"doi\":\"10.31926/but.mif.2019.12.61.1.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of inverse maximum flow in planar network (IMFPN), where upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a maximum flow in the modified network. A strongly polynomial algorithm for solving this problem is proposed. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10\",\"PeriodicalId\":38784,\"journal\":{\"name\":\"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31926/but.mif.2019.12.61.1.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31926/but.mif.2019.12.61.1.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们考虑了平面网络（IMFPN）中的逆最大流问题，其中流的上界必须尽可能小地改变，以便给定的可行流成为修改网络中的最大流。提出了一种求解该问题的强多项式算法。2000数学学科分类：90C27、90C35、68R10

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Inverse maximum flow problem in planar networks

In this paper we consider the problem of inverse maximum flow in planar network (IMFPN), where upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a maximum flow in the modified network. A strongly polynomial algorithm for solving this problem is proposed. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Mathematics-Mathematics (all)

CiteScore

0.30

自引率

0.00%

发文量