Please see: http://coral.ie.lehigh.edu/~magh/resume/resume07Sep.pdf

Research Interests
Large-scale discrete-optimization; mathematical programming and polyhedral
theory; decomposition methods
for integer programming; optimization software development. Application areas
include logistics, inventory
management and financial portfolio optimization.

Education
Lehigh University – Bethlehem, PA
Ph.D. Candidate (ABD) in Industrial and Systems Engineering (ISE).
• Area of Research: Operations Research and Applied Statistics
• Expected Completion: November 2007, GPA: 3.78/4.00
• Thesis: “Decomposition in Integer Programming”
• Advisor: Professor Ted Ralphs
Development of a theoretical and computational framework (DECOMP) for
incorporating dynamic cut
generation into traditional decomposition methods (Dantzig-Wolfe, Lagrangian
Relaxation) for integer programming.
Presentation of a new paradigm for separation called Decompose and Cut, which
takes advantage
of the fact that separation of a solution to a combinatorial relaxation is often
much easier than separation
of an arbitrary real vector. DECOMP provides a generic framework for doing
separation using these ideas.