A new algorithm for the maximum-weight clique problem

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    28 Citations (Scopus)
    Original languageEnglish
    Title of host publication6th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, The Netherlands, 26.-28.5.1999
    EditorsH. Broersma, U. Faigle, C. Hoede, J. Hurink
    Place of PublicationEnschede, The Netherlands
    PublisherUniversity of Twente, Faculty of Mathematical Sciences
    Pages188-191
    Publication statusPublished - 1999
    MoE publication typeA4 Article in a conference publication

    Keywords

    • branch-and-bound algorithm
    • graph algorithm
    • maximum clique problem

    Cite this