The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics, and also because the minimum bisection of (general) cubic graphs plays a role in the construction of efficient exponential-time algorithms, and it seems likely that random cubic graphs are extremal. It is... Read more »

Professor Miguel Anjos from the University of Edinburgh is giving a seminar on: Tight-and-Cheap Conic Relaxations for AC Optimal Power Flow and Optimal Reactive Power Dispatch   Abstract: The classical alternating current optimal power flow problem is nonconvex and generally hard to solve. We propose a new conic relaxation obtained by combining semidefinite optimization with... Read more »

TITLE: Learn to Relax: Integrating Integer Linear Programming with Conflict-Driven Search   ABSTRACT: Pseudo-Boolean (PB) solvers optimize 0-1 integer linear programs by extending the conflict-driven learning paradigm from SAT solving. Though PB solvers should be exponentially more efficient than SAT solvers in theory, in practice they can sometimes get hopelessly stuck even when the relaxed... Read more »