Inductive Linearization for Binary Quadratic Programs with Linear Constraints: A Computational Study
Abstract
The computational performance of inductive linearizations for binary quadratic programs in combination with a mixed-integer programming solver is investigated for several combinatorial optimization problems and established benchmark instances. Apparently, a few of these are solved to optimality for the first timeSimilar works
Full text
Last time updated on 26/11/2021
This paper was published in computer science publication server.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.