Cite
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.
MLA
Feldmann, Andreas, et al. “On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree.” Mathematical Programming, vol. 160, no. 1/2, Nov. 2016, pp. 379–406. EBSCOhost, https://doi.org/10.1007/s10107-016-0987-5.
APA
Feldmann, A., Könemann, J., Olver, N., & Sanità, L. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming, 160(1/2), 379–406. https://doi.org/10.1007/s10107-016-0987-5
Chicago
Feldmann, Andreas, Jochen Könemann, Neil Olver, and Laura Sanità. 2016. “On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree.” Mathematical Programming 160 (1/2): 379–406. doi:10.1007/s10107-016-0987-5.