Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem (bibtex)
by
Reference:
Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree ProblemPeter PutzOct 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl
Bibtex Entry:
@MASTERSTHESIS{putz_07,
author = {Peter Putz},
title = {Subgradient Optimization Based {L}agrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem},
school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
month = Oct,
year = {2007},
address = {Vienna, Austria},
url = {https://www.ac.tuwien.ac.at/files/pub/putz_07.pdf},
note = {supervised by G.~Raidl},
keywords = {hybrid,netdesign}
}
Powered by bibtexbrowser