An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
文献类型：期刊论文
| 作者 | Chen, Liang1,2; Chen, Wei-Kun3; Yang, Mu-Ming1,2; Dai, Yu-Hong1,2 |
| 刊名 | JOURNAL OF GLOBAL OPTIMIZATION
 |
| 出版日期 | 2021-01-04 |
| 页码 | 31 |
| 关键词 | Cutting planes Exact separation Flow arc-set polyhedron Unsplittable capacitated network design |
| ISSN号 | 0925-5001 |
| DOI | 10.1007/s10898-020-00967-z |
| 英文摘要 | In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-set polyhedron of the considered problem as a substructure and generate cutting planes by solving the separation problem over it. To relieve the computational burden, we show that, in some special cases, a closed form of the separation problem can be derived. For the general case, a brute-force algorithm, called exact separation algorithm, is employed in solving the separation problem of the considered polyhedron such that the constructed inequality guarantees to be facet-defining. Furthermore, a new technique is presented to accelerate the exact separation algorithm, which significantly decreases the number of iterations in the algorithm. Finally, a comprehensive computational study on the unsplittable capacitated network design problem is presented to demonstrate the effectiveness of the proposed algorithm. |
| 资助项目 | Beijing Institute of Technology Research Fund Program for Young Scholars[3170011181905] ; Beijing Institute of Technology Research Fund Program for Young Scholars[3170011182012] ; Chinese NSF[11631013] ; Chinese NSF[11991020] ; Chinese NSF[12021001] ; Chinese NSF[11991021] ; Chinese NSF[11971372] ; Beijing Academy of Artificial Intelligence (BAAI) |
| WOS研究方向 | Operations Research & Management Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000604467200002 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/57940]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Chen, Wei-Kun |
| 作者单位 | 1.Chinese Acad Sci, Acad Math & Syst Sci, LSEC, ICMSEC, Beijing, Peoples R China 2.Univ Chinese Acad Sci, Sch Math Sci, Beijing, Peoples R China 3.Beijing Inst Technol, Beijing Key Lab MCAACI, Sch Math & Stat, Beijing, Peoples R China |
| 推荐引用方式 GB/T 7714 | Chen, Liang,Chen, Wei-Kun,Yang, Mu-Ming,et al. An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron[J]. JOURNAL OF GLOBAL OPTIMIZATION,2021:31. |
| APA | Chen, Liang,Chen, Wei-Kun,Yang, Mu-Ming,&Dai, Yu-Hong.(2021).An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron.JOURNAL OF GLOBAL OPTIMIZATION,31. |
| MLA | Chen, Liang,et al."An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron".JOURNAL OF GLOBAL OPTIMIZATION (2021):31. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。