Local search method is a rising star for solving combinatorial optimization problems in recent years, and many state-of-the-art local search-based incomplete Maximum Satisfiability (MaxSAT) solvers ...

Real-world optimization problems often require an external “modeling engine” that computes fitnesses or data that are then input to an objective function. These programs often have much longer ...

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks. For ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...