Binary Quadratic Problem decomposition methods - kQKP datasethttps://doi.org/10.13130/RD_UNIMI/3QA23KCeselli, AlbertoLétocart, LucasTraversi, EmilianoUNIMI Dataverse2021-07-272021-07-27T11:09:00ZThe dataset contains instances for the cardinality constrained quadratic knapsack problem. These are used to test decomposition methods for Binary Quadratic Programs. Full details are given in the corresponding paper "Dantzig-Wolfe Reformulations for Binary Quadratic Problems ". The dataset contains three sets of instances
- qcr_instances: base instance, together with the optimal quadratic convex reformulation (QCR) multipliers found by solving an associated semidefinite program
- mqcr_instances: base instance, together with the optimal improved convex 0-1 quadratic program reformulation (MQCR) multipliers found by solving an associated semidefinite program
- convexity_analysis: instances in which the objective function quadratic cost matrix has a given number of positive eigenvalues.Computer and Information ScienceMathematical SciencesMathematical programmingdecomposition methodsA. Ceselli, L. Letocart, E. Traversi "Dantzig-Wolfe Reformulations for Binary Quadratic Problems ", Mathematical Programming Computation, accepted for publication (2021)Ceselli, Alberto2021-07-27CC0CC0 Waiver