Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Gruber, Martin; Raidl, Günther R.

by Martin Gruber, Günther R. Raidl

Reference:

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree ProblemMartin Gruber, Günther R. RaidlProceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society.

Bibtex Entry:

@INPROCEEDINGS{gruber-08b,
  author    = {Martin Gruber and G{\"u}nther R. Raidl},
  title     = {Heuristic Cut Separation in a Branch{\&}Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem},
  booktitle = {Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008},
  year      = {2008},
  pages     = {261--264},
  publisher = {IEEE Computer Society},
keywords = {netdesign,hybrid,mip},
  url = {https://www.ac.tuwien.ac.at/files/pub/gruber-08b.pdf},
}