Home > Research > Browse

Results for Branch-and-bound

Publications & Outputs

  1. Solving Large Maximum Clique Problems on a Quantum Annealer

    Pelofske, E., Hahn, G. & Djidjev, H., 1/01/2019, Quantum Technology and Optimization Problems - 1st International Workshop, QTOP 2019, Proceedings. Feld, S. & Linnhoff-Popien, C. (eds.). Springer-Verlag, p. 123-135 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11413 LNCS).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  2. A note on upper bounds to the robust knapsack problem with discrete scenarios

    Goerigk, M., 12/2014, In: Annals of Operations Research. 223, 1, p. 461-469 9 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  3. A lagrangian relaxation approach for gene regulatory networks

    Cordone, R. & Lulli, G., 1/12/2011, p. 122-125. 4 p.

    Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review