(i) Representative Publication

• Y. Guan. Algorithms for stochastic lot-sizing problems with backlogging. Submitted for publication. (pdf)

• Y. Guan, S. Ahmed and G. L. Nemhauser. Cutting planes for multi-stage stochastic integer programs. Accepted for publication. Operations Research. (pdf)

• Y. Guan and A. J. Miller. Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Accepted for publication. Operations Research. (pdf)

• Y. Guan, S. Ahmed and G. L. Nemhauser. Sequential pairing of mixed integer inequalities.  Discrete Optimization. 4:21-39, 2007. (pdf)

• Y. Guan, A. J. Miller, S. Ahmed and G. L. Nemhauser. On formulations of the stochastic uncapacitated lot-sizing problem. Operations Research Letters. 34: 241-250, 2006. (pdf)

• Y. Guan, S. Ahmed, G. L. Nemhauser and A. J. Miller. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Mathematical Programming, Series A. 105: 55-84, 2006. (pdf)

• S. Ahmed and Y. Guan. The inverse optimal value problem. Mathematical Programming, Series A. 102: 91-110, 2005. (pdf)

• Y. Guan, W. Q. Xiao, R. K. Cheung and C. L. Li. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters, 30:343-350, 2002. (pdf)

(ii) Others

• Y. Guan and A. Miller.  A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging. Proceedings of the 13th conference on Integer Programming and Combinatorial Optimization, Bertinoro, Italy 2008.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Sequential pairing of mixed integer inequalities. Proceedings of the 11th conference on Integer Programming and Combinatorial Optimization, Volume 3064, Lecture Notes in Computer Science, Berlin, German 2005.

• Y. Guan and R. K. Cheung. The berth allocation problem. Container Terminals and Automated Transport Systems, Hans-Otto Guenther and Kap Hwan Kim (Eds.), Springer, August 2004.

• W. Yang, H. Owen, D. M. Blough and Y. Guan. An auction pricing strategy for dierentiated service networks. Proceedings of IEEE GlobalCom, December 2003.

• R. K. Cheung, C. L. Li, W. Q. Xiao and Y. Guan. The berth allocation and scheduling problem. Proceedings of Triennial Symposium on Transportation Analysis IV, Portugal, June 2001.

(iii) Conference Talk and Activities

• Y. Guan and A. Miller. Polynomial time algorithms for the stochastic uncapacitated lot-sizing problem with backlogging. INFORMS Regional Conference 2008, College Station, TX, April 2008.
   
• Y. Guan and B. Zeng. A study of stochastic dynamic knapsack problem.  INFORMS Optimization Society Conference 2008, Atlanta, GA, March 2008.

• Y. Guan and A. Miller. Polynomial time algorithms for the stochastic uncapacitated lot-sizing problem with backlogging. INFORMS Optimization Society Conference 2008, Atlanta, GA, March 2008.
   
• Y. Guan. Progress report on Polyhedral Combinatorics and Algorithms for Stochastic Integer Programming. NSF CMMI Grantees Conference 2008, Knoxville, TN, January 2008.
   
• Y. Guan and A. Miller. How hard is economic lot-sizing problem under uncertainty?  INFORMS Annual Meeting, Seattle, WA, November 2007.
   
• Y. Guan, K. H. Yang and S. Pulat. Container Security and Berth Allocation Progress Report. CELDi Fall 2007 Meeting, Atlanta, GA, October 2007.
   
• Y. Guan. Symposium in honor of George Nemhauser's 70th birthday. Atlanta, GA, July 2007.

• Y. Guan, K. H. Yang and S. Pulat. Simulation and Optimization Studies on a Multiprocessor Job Scheduling System with Inspection Operations. IIE Annual Conference, Nashville, TN, May 2007.

• Y. Guan. Weather Forecasting and Decision Making under Uncertainty. National Weather Center Seminar Series, Norman OK, March 2007.

• Y. Guan, S. Pulat and T. Liu. Improving inventory accuracy through optimal cycle counting-Progress report II. CELDi Spring 2007 Meeting, Phoenix, AZ, March 2007.

• Y. Guan. Workshop for weather forecasting and decision making organized by NSF. Monterey, CA, January 2007.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Cutting planes for multi-stage stochastic integer programs. INFORMS Annual Meeting, Pittsburgh, PA, November 2006.

• Y. Guan and A. J. Miller. Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. INFORMS Annual Meeting, Pittsburgh, PA, November 2006.

• Y. Guan, S. Pulat and T. Liu. Improving inventory accuracy through optimal cycle counting-Progress report I. CELDi Fall 2006 Meeting, Dallas, TX, October 2006.

• Y. Guan, S. Pulat and T. Liu. Improving inventory accuracy through optimal cycle counting. CELDi Spring 2006 Meeting, Orlando, FL, April 2006.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Sequential pairing of mixed integer inequalities: Tree case. INFORMS Annual Meeting, San Francisco, CA, November 2005.

• Y. Guan. IMA Special Workshop: Mixed-Integer Programming, Minneapolis, MN, July 2005.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Combining 0-1 inequalities. INFORMS Annual Meeting, Denver, CO, October 2004.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Strong formulations for the multi-item stochastic capacitated lot-sizing problem. The Tenth International Conference on Stochastic Programming, Tucson, AZ, October 2004.

• Y. Guan, S. Ahmed and G. L. Nemhauser. Polyhedral aspects of the stochastic uncapacitated lot-sizing problem. INFORMS Annual Meeting, Atlanta, GA, October 2003.

• Y. Guan, S. Ahmed and G. L. Nemhauser. A polyhedral approach to the stochastic uncapacitated lot-sizing problem. NSF Workshop on Stochastic Combinatorial Optimization, Providence, RI, August 2003.

• Y. Guan and R. K. Cheung. The berth allocation problem. Maritime Logistics Workshop, Atlanta, GA, October 2002.