期刊
OPERATIONS RESEARCH LETTERS
卷 38, 期 1, 页码 33-38出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.09.013
关键词
Network flows; Integer programming; Integrality gap; Valid inequalities
资金
- NSF [DMI-0238815]
We present two classes of polynomially separable valid inequalities for the Maximum Flow Network Interdiction Problem. We prove that the integrality gap of the standard integer program is not bounded by a constant, even when strengthened by our valid inequalities. Finally, we provide an approximation-factor-preserving reduction from a simpler interdiction problem. Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据