I am an assistant professor in Industrial Engineering at USC. I am interested in the theory and applications of supply chain models involving transportation and inventory decisions. The methodology I use to study these problems includes mixed-integer programming and dynamic programming.
Some useful links:
Prospective students: Please e-mail "isedept at vsoe dot usc dot edu" with questions about our Ph.D. program. In order for me to consider you as a potential Ph.D., you should first submit an application to our program.
Published or Accepted
We introduce a fixed-charge transportation problem with linear product blending and give a polyhedral analysis. Applications include transportation problems in the petrochemical, energy and agriculture industries.
We study models for piecewise linear data fitting (regression), including new mixed-binary models with variable regions. Applications include approximate inventory valuation.
We characterize the value function of a discounted, infinite-horizon variant of the single-item production lot-sizing problem and show that it inherits several structural properties from finite mixed-integer program value functions.
We introduce a time decomposition for inventory routing problems that depends on approximately valuing inventories at suppliers and consumers. Computational experiments use maritime inventory routing instances.
We develop an algorithm to calculate how stable a solution to a binary mixed-integer program is with respect to cost changes. Applications include real-time decision making scenarios, such as iterative combinatorial auctions.
Submitted or Under Review
We consider cooperative traveling salesman games with non-negative asymmetric costs satisfying the triangle inequality. Using a variant of the Held-Karp relaxation and its dual, we construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem.
We propose a framework of lower bounds for the asymmetric TSP based on approximating the dynamic programming formulation. We then introduce an exact reformulation that generates a family of polynomially-solvable, successively tighter lower bounds. We show that the base member of this family yields a bound greater than or equal to the well-known Held-Karp bound.
We evaluate the California cut flower industry’s current transportation practices and investigate the feasibility and cost of establishing a shipping consolidation center in Oxnard, California.
Miscellaneous
* Indicates supervised student co-author.
Teamcore Research Group, USC. April, 2012.
All course materials available on USC's Blackboard.
ISE 330 - Introduction to Operations Research: Deterministic Models
ISE 532 - Network Flows
Shabbir Ahmed, Dan Dadush, Maged Dessouky, Will Haskell, Fatma Kilinc-Karzan, Mariel Lavieri, Jim Moore, George Nemhauser, Dimitri Papageorgiou, Luis Rademacher, Martin Savelsbergh, Nelson Uhan, Juan Pablo Vielma