Book
Potential function methods for approximately solving linear programming problems, Theory and Practice, Springer,  ISBN 978-1-4020-7173-7 (2002).

Downloadable reports

A new LP algorithm for precedence constrained production scheduling (with M. Zuckerberg) pdf

Eigenvalue techniques for proving bounds for convex objective, nonconvex programs, pdf

The N-k problem in power grids: new models, formulations and computation (with A. Verma) pdf (Data.)

Tightening simple mixed-integer sets with guaranteed bounds (with B. McClosky) pdf

Histogram models for robust portfolio optimization pdf

Approximate formulations for 0-1 knapsack sets pdf

Computing robust basestock levels, (with N. Ozbay) pdf

Using mixed-integer programming to solve power grid blackout problems, (with S. Mattia) pdf

Faster approximation for packing and covering problems, (with G. Iyengar) pdf

Tree-width and the Sherali-Adams operator, (with N. Ozbay) pdf

Concurrent flows in O(1/epsilon) iterations, (with G. Iyengar) pdf

Approximate fixed-rank closures of covering problems, (with Mark Zuckerberg) pdf .

Scalable optimization for multi-period optical network capacity expansion with elastic demand, (with O. Raskina, I. Saniee and Q. Wang) CORC Report 2002-08 .

Subset Algebra Lift Operators for 0-1 Integer Programming, (with Mark Zuckerberg) pdf.

Potential function methods for approximately solving linear programming problems: Theory and Practice, CORE Lecture Series, ISSN-0771 3894 (2001). Available from CORE (U. Catholique de Louvain, Belgium).

Asymptotic Analysis of the Flow Deviation Method for the Maximum Concurrent Flow Problem, (PostScript)(PDF), (with O. Raskina), CORC Report 2000-02 Math. Programming 91 (2002), 379-392.

Approximately solving large-scale linear programs. I: Strengthening lower bounds and accelerating convergence, CORC Report 1999-1.

Strong inequalities for capacitated survivable network design problems, (with G. Muratore) (1997), CORC Report 1999-3, Math. Programming 89 (2001), 127-147.

ATM network design: traffic models and optimization-based heuristics, (with I. Saniee) (1997), Telecomm. Systems 16 (2001), 399-421.

Experiments with a network design algorithm using epsilon-approximate linear programs (1996) CORC Report 1999-4.

Mininum cost capacity installation for multicommodity flows, (with O. Günlük, S. Chopra and C.Y. Tsai) Math. Programming 81 (1998), 177-199.

Capacitated network design - polyhedral structure and computation, (with O. Günlük) ORSA J. Comp. 8 (1996), 243-260.

Computational study of a family of mixed-integer quadratic programming problems, Math. Programming 74 (1996), 121-140.