Research

Welcome to my research home page. Perhaps you’re looking for one of these:

If not, then maybe you’d like a description of my research. My research focuses mainly on various aspects of mixed-integer linear programming. I try to maintain a balance between theory, computation, and application, with an aim
of bridging the gap between theory and practice. Specific areas that I am currently working on are listed below.

  • Theory and Methodology
    • Branch, cut, and price algorithms
    • Integrated decomposition methods
    • Multicriteria mixed-integer programming algorithms
    • Warm starting and sensitivity analysis for mixed-integer programming
    • Bilevel Programming
    • Parallel algorithms
  • Software Development
    • COIN-OR Project (Common Infrastructure for Operations Research)
    • SYMPHONY (C callable library for mixed-integer programming)
    • ALPS (C++ library for implementing scalable parallel search algorithms)
    • BiCePS (C++ library for implementing parallel branch, constrain, and price algorithms)
    • BLIS (C++ library built on BiCePS for solving mixed-integer linear programs)
    • OSI (the Open Solver Interface)
    • DECOMP (A framework for implementing decomposition algorithms for mixed-integer programs)
  • Applications
    • Network Routing
      • Vehicle Routing
      • Arc Routing (Postman Problems)
      • Integrated Location and Routing
    • Combinatorial Auctions
    • Interdiction Problems
    • Computational Biology
Trackback