.png){kind=icon}
返回
Layered graph approaches for combinatorial optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2018.09.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Extending the concept of time-space networks, layered graphs associate information about one or multiple resource state values with nodes and arcs. While integer programming formulations based on them allow to model complex problems comparably easy, their large size makes them hard to solve for non-trivial instances. We detail and classify layered graph modeling techniques that have been used in the (recent) scientific literature and review methods to successfully solve the resulting large-scale, extended formulations. Modeling guidelines and important observations concerning the solution of layered graph formulations by decomposition methods are given together with several future research directions. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Layered graphs
Integer programming
Extended formulations
Reformulation techniques
Decomposition methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Predicting cancer incidence in regions without population-based cancer registries using mortality
OAAI
OAAI分享收藏
查看更多内容