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., ...

This project demonstrates a complete implementation of QAOA, a hybrid quantum-classical algorithm that combines quantum circuits with classical optimization to solve combinatorial optimization ...

Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar., 1988), pp. 402-410 (9 pages) A new approximate algorithm for multidimensional zero-one knapsack problems with all positive ...

Abstract: In the massive multiple-input and multiple-output (Massive MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becoming classically intricate with the number of ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Abstract: Combinatorial optimization is a promising area for achieving quantum speedup. The quantum approximate optimization algorithm (QAOA) is designed to search for low-energy states of the Ising ...