Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

Francisco Barahona, Laszlo Ladányi. Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut. RAIRO - Operations Research, 40(1):53-73, 2006. [doi]

@article{BarahonaL06,
  title = {Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut},
  author = {Francisco Barahona and Laszlo Ladányi},
  year = {2006},
  doi = {10.1051/ro:2006010},
  url = {http://dx.doi.org/10.1051/ro:2006010},
  researchr = {https://researchr.org/publication/BarahonaL06},
  cites = {0},
  citedby = {0},
  journal = {RAIRO - Operations Research},
  volume = {40},
  number = {1},
  pages = {53-73},
}