Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.

Login

Benchmarks

  1. Home
  2. Benchmarks
  3. Report

max-cut benchmark data

This problem is standard combinatorial optimization problem and several branch an bound based based algorithms try to find global optimum for as big as possible instances. Below we describe the most recent BiqBin algorithm .
Scientific Area:
Optimization
Language/Environments:
C, C++, MatLab
Target Group:
Advanced
Link:
https://dl.acm.org/doi/10.1145/3514039
Cite as:
Nicolò Gusmeroli, Timotej Hrga, Borut Lužar, Janez Povh, Melanie Siebenhofer, and Angelika Wiegele. 2022. BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. ACM Trans. Math. Softw. 48, 2, Article 15 (June 2022), 31 pages. https://doi.org/10.1145/3514039
Author of the review:
Janez Povh
University of Ljubljana


Reviews

You have to login to leave a comment. If you are not registered click here

Back to the Benchmarks List