The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

Publisher Summary The traveling salesman problem, TSP for short, has model character in
many branches of mathematics, computer science, and operations research. Heuristics …

Abstract Model-based reinforcement learning (RL), which finds an optimal policy using an
empirical model, has long been recognized as one of the cornerstones of RL. It is especially …

Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …

The last decade witnessed an explosion in the availability of data for operations research
applications. Motivated by this growing availability, we propose a novel schema for utilizing …

This book gives an elementary treatment of the basic material about graph spectra, both for
ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering …

Malicious attacks against power systems are investigated, in which an adversary controls a
set of meters and is able to alter the measurements from those meters. Two regimes of …

In this paper we improve upon the running time for finding a point in a convex set given a
separation oracle. In particular, given a separation oracle for a convex set K⊂ R n that is …

We present a new polynomial-time algorithm for linear programming. The running-time of
this algorithm is O (n 3-5 L 2), as compared to O (n 6 L 2) for the ellipsoid algorithm. We …

The purpose of this book is to present the general theory of interior-point polynomial-time
methods for convex programming. Since the publication of Karmarkar's famous paper in …