KMS Of Academy of mathematics and systems sciences, CAS
| 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 | |
| 2021-01-04 | |
| Source Publication | JOURNAL OF GLOBAL OPTIMIZATION
 |
| ISSN | 0925-5001 |
| Pages | 31 |
| Abstract | 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. |
| Keyword | Cutting planes Exact separation Flow arc-set polyhedron Unsplittable capacitated network design |
| DOI | 10.1007/s10898-020-00967-z |
| Indexed By | SCI |
| Language | 英语 |
| Funding Project | 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 Research Area | Operations Research & Management Science ; Mathematics |
| WOS Subject | Operations Research & Management Science ; Mathematics, Applied |
| WOS ID | WOS:000604467200002 |
| Publisher | SPRINGER |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/57941 |
| Collection | 中国科学院数学与系统科学研究院 |
| Corresponding Author | Chen, Wei-Kun |
| Affiliation | 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 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment