A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

Reviewer assignment algorithms and systems have emerged as critical tools in modern academic publishing and research evaluation, ensuring that submitted manuscripts are matched with expert reviewers ...

Seeking to reduce the computing power needed for the widely used dynamic mode decomposition algorithm, a team of researchers in China led by Guo-Ping Guo developed a quantum-classical hybrid algorithm ...