Anureet Saxena's list of research articles

PhD Thesis

• Integer Programming, a Technology.

Disjunctive Programming

• (with:- P. Bonami and J. Lee) Disjunctive Cuts for Non-Convex Mixed Integer Quadratically Constrained Programs, Optimization Online (eprint) (To appear in IPCO 2008)

Probabilistic Programming

• (with:- V. Goyal and M. Lejeune) MIP Reformulations of the Probabilistic Set Covering Problem, Math. Prog. Ser. A (online first).
• A Short Note on the Probabilistic Set Covering Problem, Optimization Online (eprint)

Optimization over Elementary Closures

• (with: -Egon Balas) Optimizing over the Split Closure, Math. Prog. Ser. A (online first).

Set Covering Polytope

• On the Set-Covering Polytope: I. All the facets with coefficients in {0,1,2,3} , GSIA Working Paper #2004-E37, 2004.
• On the Set-Covering Polytope: II. Lifting facets with coefficients in {0,1,2,3} , GSIA Working Paper #2004-E30, 2004.
• On the Set-Covering Polytope III: Complete characterization of 3-critical matrices , GSIA Working Paper #2004-E31, 2004.

Dominating Set Polytope

• Polyhedral studies in Domination Graph Theory (I) , GSIA Working Paper #2003-E80, 2003.
• Some results on the Dominating Set Polytope of a Cycle , GSIA Working Paper #2004-E28, 2004.
• On the Dominating Set Polytope of a Cycle , GSIA Working Paper #2004-E32, 2004.

Primal Integer Programming

• Set-Partitioning via Integral Simplex Method , GSIA Working Paper #2003-E75, 2003.
• Avoiding Cycling in Integral Simplex Methods , GSIA Working Paper #2003-E75, 2003.
• Reducing Non-basic columns with positive reduced cost in Integral Simplex Methods for Set Partitioning , GSIA Working Paper #2003-E75, 2003.