One-pass heuristics for large-scale unconstrained binary quadratic problems


Many significant advances have been made in recent years for solving unconstrained binary quadratic programs (UQP). As a result, the size of problem instances that can be efficiently solved has grown from a hundred or so variables a few years ago to two or three thousand variables today. These advances have motivated new applications of the model which, in… (More)
DOI: 10.1016/S0377-2217(01)00209-0


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics