网络结构中的最优资源分配

2018 Eleventh International Conference "Management of large-scale system development" (MLSD Pub Date : 2018-10-01 DOI:10.1109/MLSD.2018.8551936

V. Burkov, A. Enaleev

{"title":"网络结构中的最优资源分配","authors":"V. Burkov, A. Enaleev","doi":"10.1109/MLSD.2018.8551936","DOIUrl":null,"url":null,"abstract":"This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.","PeriodicalId":158352,"journal":{"name":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal Resource Allocation in Network Structures\",\"authors\":\"V. Burkov, A. Enaleev\",\"doi\":\"10.1109/MLSD.2018.8551936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.\",\"PeriodicalId\":158352,\"journal\":{\"name\":\"2018 Eleventh International Conference \\\"Management of large-scale system development\\\" (MLSD\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference \\\"Management of large-scale system development\\\" (MLSD\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MLSD.2018.8551936\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSD.2018.8551936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了多个连接代理之间的资源分配问题。没有等高线的有向图表示代理之间的连接。只有当其输出连接到该代理的输入的所有代理都获得所需的资源时，任何代理才能获得资源。我们描述了解决这个问题的两种算法(精确算法和启发式算法)，并给出了计算示例。

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

查看原文本刊更多论文

Optimal Resource Allocation in Network Structures

This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.

求助全文

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

来源期刊

2018 Eleventh International Conference "Management of large-scale system development" (MLSD

自引率

0.00%

发文量