.png){kind=icon}
返回
The transportation problem with conflicts
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-018-3004-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The transportation problem is a fundamental problem in operations research, where items need to be transported from supply nodes (each with a given supply) to demand nodes (each with a given demand) in the cheapest possible way. Here, we are interested in a generalization of the transportation problem where, each supply node has a (possibly empty) set of conflicting pairs of demand nodes, and each demand node a (possibly empty) set of conflicting pairs of supply nodes. Each supply node may only send supply to at most one demand node of each conflicting pair. Likewise, each demand node may only receive supply from at most one supply node of each conflicting pair. We call the resulting problem the transportation problem with conflicts (TPC). We show that the complexity of TPC depends upon the structure of the so-called conflict graph that follows from the conflicting pairs. More concrete, we show that for many graph-classes the corresponding TPC remains NP-hard, and for some special cases we derive constant factor approximation algorithms.
Keyword:
Transportation problem
Conflict graph
Computational complexity
Approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
分享收藏
MHD nanofluid heat transfer between a stretching sheet and a porous surface using neural network approach利用神经网络方法研究磁 hydrodynamics (MHD)纳米流体在拉伸板与多孔表面之间的传热
PREAI
分享收藏The transportation problem with exclusionary side constraints and two branch-and-bound algorithms具有排除侧约束的运输问题和两个分支定界算法
PREAI
分享收藏
查看更多内容