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

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

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

The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 705-716 (12 pages) The Bin Packing Problem and the Cutting Stock Problem are two ...

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

The financial world grows on managing risk, but the models used to calculate exposure—from market volatility to ...

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

Like octopuses squeezing through a tiny sea cave, metatruss robots can adapt to demanding environments by changing their shape. These mighty morphing robots are made of trusses composed of hundreds of ...

Xinyun Wu: Post-doctoral Fellow during 2017-2018. Currently works at Hubei University of Technology as Assistant Professor in Computer Science. His research interests include design and analysis 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 ...