Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints

Martin Grötschel, Clyde L. Monma, Mechthild Stoer. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Operations Research, 40(2):309-330, 1992. [doi]

@article{GrotschelMS92-0,
  title = {Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints},
  author = {Martin Grötschel and Clyde L. Monma and Mechthild Stoer},
  year = {1992},
  doi = {10.1287/opre.40.2.309},
  url = {http://dx.doi.org/10.1287/opre.40.2.309},
  researchr = {https://researchr.org/publication/GrotschelMS92-0},
  cites = {0},
  citedby = {0},
  journal = {Operations Research},
  volume = {40},
  number = {2},
  pages = {309-330},
}