Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems (bibtex)
by
Reference:
Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree ProblemsFerdinand Zaubzermay 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and M. Gruber
Bibtex Entry:
@MASTERSTHESIS{zaubzer_f:08,
  author   = {Ferdinand Zaubzer},
  title    = {{L}agrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems},
  school   = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
  month    = may,
  year     = {2008},
  address  = {Vienna, Austria},
  note     = {supervised by G.~Raidl and M. Gruber},
keywords = {evolcomp, netdesign, hybrid, mip},
  url = {https://www.ac.tuwien.ac.at/files/pub/zaubzer_f-08.pdf},
}
Powered by bibtexbrowser