Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem (bibtex)
by
Reference:
Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree ProblemChristian GruberSep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and B. Hu
Bibtex Entry:
@mastersthesis{gruber_11,
  author = {Christian Gruber},
  title = {Ein {L}ösungsarchiv mit {B}ranch-and-{B}ound-{E}rweiterung für das {G}eneralized {M}inimum {S}panning {T}ree {P}roblem},
  school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
  month = Sep,
  year = {2011},
  url = {https://www.ac.tuwien.ac.at/files/pub/cgruber_11.pdf},
  note = {supervised by G.~Raidl and B.~Hu},
keywords = {evolcomp,netdesign,solarch},
}
Powered by bibtexbrowser