A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
Year of publication: |
2023
|
---|---|
Authors: | Ma, Mengfan ; Men, Ziyang ; Rossi, André ; Zhou, Yi ; Xiao, Mingyu |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 153.2023, p. 1-15
|
Subject: | Partioned Steiner tree problem | Integer linear program | Vertex-separator | Branch-and-cut | Local branching | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
Cheng Seong Khor, (2021)
-
Another pedagogy for pure-integer Gomory
He, Qi, (2017)
-
He, Xiaozheng, (2018)
- More ...
-
Finding small feedback arc sets on large graphs
Xiong, Ziliang, (2024)
-
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
Lin, Weibo, (2019)
-
Computing maximum k-defective cliques in massive graphs
Chen, Xiaoyu, (2021)
- More ...