.png){kind=icon}
返回
Incremental network design with maximum flows
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2014.10.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Network design
Approximation algorithms
Scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
查看更多机构
引用论文
分享收藏Sensitivity to Carcinogenesis in Nude Mice: Skin Tumors Caused by Transplacental Exposure to Ethylnitrosourea.png)
Science
ScienceIF0
PREAI
分享收藏Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem恢复基础设施系统: 集成网络设计和调度 (INDS) 问题
PREAI
分享收藏 没有更多内容