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

BERKELEY, Calif., Oct. 03, 2023 (GLOBE NEWSWIRE) -- Rigetti Computing, Inc. (Nasdaq: RGTI) (“Rigetti” or the “Company”), a pioneer in full-stack quantum-classical computing, today announced that it ...

The constant scaling of AI applications and other digital technologies across industries is beginning to tax the energy grid ...

A new technical paper titled “Analog optical computer for AI inference and combinatorial optimization” was published by ...

Shenzhen, May 14, 2025 (GLOBE NEWSWIRE) -- MicroAlgo Inc. Announces Research on Quantum Information Recursive Optimization (QIRO) Algorithm, for Combinatorial Optimization Problems to Expand and Solve ...

We develop a novel framework, the implicit hitting set approach, for solving a class of combinatorial optimization problems. The explicit hitting set problem is as follows: given a set U and a family ...

Recently, a research team from the Rudolf Technology Center in Slovenia proposed a new method to optimize the sparse subgraph problem, which has wide applications in fields such as network analysis ...

We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative game theory.

I am a Professor in the Department of Computer Science at California State University, Sacramento (CSUS). I joined CSUS in 2015. I obtained my Ph.D in Computer Science from the University of ...

Combinatorial optimisation algorithms are central to addressing problems in which the goal is to select an optimal solution from a finite set of alternatives. These algorithms have evolved ...