A survey on the densest subgraph problem and its variants
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 …
whose induced subgraph maximizes a measure of density. The problem has received a …
The traveling salesman problem
Publisher Summary The traveling salesman problem, TSP for short, has model character in
many branches of mathematics, computer science, and operations research. Heuristics …
many branches of mathematics, computer science, and operations research. Heuristics …
Model-based multi-agent rl in zero-sum markov games with near-optimal sample complexity
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 …
empirical model, has long been recognized as one of the cornerstones of RL. It is especially …
A faster interior point method for semidefinite programming
Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …
important recent applications in approximation algorithms, quantum complexity, robust …
Data-driven robust optimization
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 …
applications. Motivated by this growing availability, we propose a novel schema for utilizing …
[图书][B] Spectra of graphs
AE Brouwer, WH Haemers - 2011 - books.google.com
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 …
ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering …
Malicious data attacks on the smart grid
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 …
set of meters and is able to alter the measurements from those meters. Two regimes of …
A faster cutting plane method and its implications for combinatorial and convex optimization
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 …
separation oracle. In particular, given a separation oracle for a convex set K⊂ R n that is …
A new polynomial-time algorithm for linear programming
N Karmarkar - Proceedings of the sixteenth annual ACM symposium …, 1984 - dl.acm.org
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 …
this algorithm is O (n 3-5 L 2), as compared to O (n 6 L 2) for the ellipsoid algorithm. We …
[图书][B] Interior-point polynomial algorithms in convex programming
Y Nesterov, A Nemirovskii - 1994 - SIAM
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 …
methods for convex programming. Since the publication of Karmarkar's famous paper in …