Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...

Combinatorial optimisation is a fundamental field in applied mathematics and computer science that focuses on finding an optimal object from a finite set of objects. In this context, problems are ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...

The proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...

The DOE SC program in Advanced Scientific Computing Research (ASCR) hereby announces its interest in basic research in the design, development, analysis, and scalability of randomized algorithms for ...

It remains an open question when a commercial quantum computer will emerge that can outperform classical (non-quantum) ...

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, ...