Thesiss

This thesis presents two applications of combinatorial optimization. The first part contains a detailed description of a conference scheduling problem. We model the problem as a symmetric clustering problem, or a variant of minimum k -partition we call capacitated k -partition .…

The related tasks of certifying bounds on optimization problems and refuting unsatisfiable systems of constraints have a long history in computer science and optimization, and deep mathematical roots in the proof complexity of algebraic systems. From the algorithmic perspective,…

Real algebraic geometry has a long and beautiful history going back to the 1800s. It is the study of real polynomials using algebraic techniques. Convex optimization plays a key role in applied mathematics and engineering, studying the geometric structure of convex sets that ari…