We present a new way to make Ising machines, ie, using networks of coupled self-sustaining
nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes …

Structural balance theory affirms that signed social networks (ie, graphs whose signed
edges represent friendly/hostile interactions among individuals) tend to be organized so as …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

In the last two decades, the mathematical programming community has witnessed some
spectacular advances in interior point methods and robust optimization. These advances …

We estimate n phases (angles) from noisy pairwise relative phase measurements. The task
is modeled as a nonconvex least-squares optimization problem. It was recently shown that …

Abstract We present OIM (Oscillator Ising Machines), a new way to make Ising machines
using networks of coupled self-sustaining nonlinear oscillators. OIM is theoretically rooted in …

We present a method for finding exact solutions of Max-Cut, the problem of finding a cut of
maximum weight in a weighted graph. We use a Branch-and-Bound setting that applies a …

The maximum-cut problem is one of the fundamental problems in combinatorial
optimization. With the advent of quantum computers, both the maximum-cut and the …

To address difficult optimization problems, convex relaxations based on semidefinite
programming are now common place in many fields. Although solvable in polynomial time …

This paper studies how to design abstractions of large-scale combinatorial optimization
problems that can leverage existing state-of-the-art solvers in general-purpose ways, and …