.png){kind=icon}
返回
A linear input dependence model for interdependent networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.01.020.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a linear relaxation of a generalized minimum-cost network flow problem with binary input dependencies. In this model the flows through certain arcs are bounded by linear (or more generally, piecewise linear concave) functions of the flows through other arcs. This formulation can be used to model interrelated systems in which the components of one system require the delivery of material from another system in order to function (for example, components of a subway system may require delivery of electrical power from a separate system). We propose and study randomized rounding schemes for how this model can be used to approximate solutions to a related mixed integer linear program for modeling binary input dependencies. The introduction of side constraints prevents this problem from being solved using the well-known network simplex algorithm, however by characterizing its basis structure we develop a generalization of network simplex algorithm that can be used for its computationally efficient solution. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
(R) Networks
Interdependent networks
Input dependence
Network simplex algorithm
Randomized rounding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Modeling infrastructure interdependencies by integrating network and fuzzy set theory通过集成网络和模糊集理论对基础设施的相互依赖性进行建模
PREAI
分享收藏分享收藏
查看更多内容