Research

Paper in Preparations

1. Huang, K.-L., (2019). On implementing a modified potential reduction method for second-order conic optimization.

Publications

1. Bansal, M., Huang, K.-L., and Mehrotra, S. (2018). Decomposition algorithms for two-stage distributionally robust mixed binary problem. SIAM Journal on Optimization, 28(3):2360-2383. [pdf]
2. Bansal, M., Huang, K.-L., and Mehrotra, S. (2018). Tight second-stage MIP formulations for two-stage stochastic mixed integer programs. SIAM Journal on Optimization, 28(1):788-819. [pdf]
3. Huang, K.-L. and Mehrotra, S. (2017). Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method. INFORMS Journal on Computing, 29(1):35-53. [pdf]
4. Di, M., Huang, K.-L., Klabjan, D., and Shebalov, S. (2015). Attractiveness-based stochastic fleeting by MapReduce. INFORMS Journal on Computing (submitted). [pdf]
5. Huang, K.-L. and Mehrotra, S. (2015). An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs. Computational Optimization and Applications, 60(3):559-585. [pdf]
6. Huang, K.-L. and Mehrotra, S. (2014). On implementing a general disjunctive branching algorithm using lattice basis reduction for mixed integer convex programming. Optimization Method and Software. [pdf]
7. Huang, K.-L. and Mehrtora, S. (2013). An empirical evaluation of walk-and-round heuristics for mixed integer linear programs. Computational Optimization and Applications, 55(3):545-570. [pdf]
8. Liao, C.-J., Tsou, H.-H., and Huang, K.-L. (2012). Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. Theoretical Computer Science, 434:45-52. [pdf]
9. Mehrotra, S. and Huang, K.-L. (2012). Computational experience with a modified potential reduction algorithm for linear programming. Optimization Method and Software, 27(4-5):865-891. [pdf]
10. Tseng, C.-T., Liao, C.-J., and Huang, K.-L. (2009). Minimizing total tardiness on a single machine with controllable processing times. Computers & Operations Research, 36(4):1852-858. [pdf]
11. Huang, K.-L. and Liao, C.-J. (2008). Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 35(4):1030-1046. [pdf]

Technical Reports

1. Huang, K.-L., Geng, Y., Jiang, Y., and Lee, C. (2019). Network Design and Optimization. HCADS Technical Report, Anthem. [pdf]
2. Huang, K.-L. and Mehrotra, S. (2019). C-SAM models for scheduling surveyors to events for the Joint Commission surveyor scheduling system. Technical Report, Colin, LLC. [pdf]
3. Huang, K.-L. and Mehrotra, S. (2015). iOptimize-SOS: iOptimize-Stochastic Optimization Solver. IE/MS Technical Report, Northwestern University. [pdf]
4. Koc, U., Huang, K.-L., and Mehrotra, S. (2014). Concurrent Generation of Feasible Integer Solutions Using Random Walks. IE/MS Technical Report, Northwestern University. [pdf]

Conference Talks

1. Bansal, M., Huang, K.-L., and Mehrotra, S. (2016). On Solving General Two-Stage Stochastic and Distributionally Robust Programs. Mixed Integer Programming Workshop (poster session). Miami, FL. [pdf]
2. Mehrotra, S. and Huang, K.-L. (2016). Computational experience with an efficient L-Shaped method for two-stage stochastic mixed integer programs. INFORMS International Optimization Society. Princeton, NJ. [pdf]
3. Bansal, M., Huang, K.-L., and Mehrotra, S. (2015). Tight second-stage formulations in two-stage stochastic mixed integer programs. ACNW Workshop (poster session). Chicago, IL. [pdf]
4. Bansal, M., Huang, K.-L., and Mehrotra, S. (2015). Tight second-stage formulations in two-stage stochastic mixed integer programs. Mixed Integer Programming Workshop (poster session). Chicago, IL. [pdf]
5. Bansal, M., Huang, K.-L., and Mehrotra, S. (2015). Tight second-stage formulations in two-stage stochastic mixed integer programs. INFORMS Computing Society. Richmond, VA. [pdf]
6. Huang, K.-L., Kim, K., and Mehrotra, S. (2015). A computational study of a Benders algorithm for solving two-stage stochastic mixed-integer linear programs. INFORMS Computing Society. Richmond, VA. [pdf]
7. Huang, K.-L,. Kim, K., and Mehrotra, S. (2014). Two-stage stochastic programs with mixed binary recourse function. INFORMS Annual Meeting. San Francisco, CA. [pdf]
8. Mehrotra, S, Huang, K.-L., Koc, U., and Li, Z. (2014). Can interior solutions help in solving mixed integer programs? MINLP workshop. Pittsburgh, PA. [pdf]
9. Mehrotra, S. and Huang, K.-L. (2013). A Modified Potential Reduction Method for Monotone Complementarity and Convex Programming Problems. INFORMS International Optimization Society. Miami, FL. [pdf]
10. Huang, K.-L. and Mehrotra, S. (2012). A Modified Potential Reduction Method for Monotone Complementarity and Convex Programming Problems. INFORMS Annual Meeting. Phoenix, AZ. [pdf]
11. Mehrotra, S. and Huang, K.-L. (2012). Using Lattice Basis Reduction to Compute General Disjunctions in Practice. INFORMS Annual Meeting. Phoenix, AZ. [pdf]
12. Mehrotra, S. and Huang, K.-L. (2009). A new heuristic for general mixed integer programming. INFORMS Annual Meeting. San Diego, CA. [pdf]
13. Mehrotra, S. and Huang, K.-L. (2009). Revisiting homogeneous self-dual method for linear programming. INFORMS Annual Meeting. San Diego, CA. [pdf]
14. Mehrotra, S., Hu, J., and Huang, K.-L. (2009). A new method for finding a feasible integer solution using simple ellipsoid search. Mixed Integer Programming Workshop. Berkeley, CA. [dvi]
15. Huang, K.-L. and Liao, C.-J. (2006). Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. 36th International Conference of Computers and Industrial Engineering. Taipei, Taiwan. [ppt]

Patents

1. Mehrotra, S. and Huang, K.-L. (2015). Software for two-stage stochastic linear programming with integer variable in the first stage. Northwestern University Patent, NU2015-124.
2. Huang, K.-L., Geng, Y., Jiang, Y., Ramesh, A., Lee, C., Bayewitz, A., and Wang, S. (2019). Network Design and Optimization. US No. 62/835,286. (Pending)