2
$\begingroup$

I'm looking for a benchmark set of instances that are formulated as binary quadratic problems, i.e.

$$\min_{x\in \{0,1\}^n} x^TQx,\quad Ax\le b,\quad A_0x = b_0 \ .$$

The particular case of binary linear programming (with diagonal $Q$) are also of interest.

Would be nice to have the problems ranging from easy to challenging even for SOTA solvers, of diverse nature. Ideally, the problems should also be industrially relevant and their origin possible to track.

Improve this question
$\endgroup$

1 Answer 1

Reset to default
3
$\begingroup$

I was testing on Quadratic Assignment Problems, there is a QAPLIB you can have a look. I think the formulation is same as your problem setting. FYI.

https://coral.ise.lehigh.edu/data-sets/qaplib/qaplib-problem-instances-and-solutions/

Improve this answer
$\endgroup$
2
  • $\begingroup$ Looks very useful, thanks! As far as I know, quadratic assignment problems involve a very specific set of constraints $\sum_i{x_{ij}}=\sum_j{x_{ij}}=1$. Any chance you are aware of a more general benchmark set? $\endgroup$
    – Weather Report
    Commented Oct 11 at 9:14
  • 1
    $\begingroup$ @WeatherReport I didn't user other benchmarks, but I just found QKPLIB, it could be useful as well. data.mendeley.com/datasets/82pxy6yv49/1 $\endgroup$
    – ytsao
    Commented Oct 11 at 9:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.