Branch-and-cut algorithms for graph problems

B. Yüceoglu

    Research output: ThesisDoctoral ThesisInternal

    351 Downloads (Pure)
    Original languageEnglish
    QualificationDoctor of Philosophy
    Awarding Institution
    • Maastricht University
    Supervisors/Advisors
    • van Hoesel, Constantinus, Supervisor
    • Grigoriev, Alexander, Advisor
    Award date26 Feb 2015
    Place of PublicationMaastricht
    Publisher
    Print ISBNs9786059092111
    Publication statusPublished - 1 Jan 2015

    Cite this

    Yüceoglu, B. (2015). Branch-and-cut algorithms for graph problems. Maastricht University.