Ant colony optimization combined with taboo search for the job shop scheduling problem. - Kuo-Ling Huang; Ching-Jong Liao (Comput. Oper. Res., 2008)

Minimizing total tardiness on a single machine with controllable processing times. - Chao-Tang Tseng; Ching-Jong Liao; Kuo-Ling Huang (Comput. Oper. Res., 2009)

Computational experience with a modified potential reduction algorithm for linear programming. - Sanjay Mehrotra; Kuo-Ling Huang (Optim. Methods Softw., 2012)

Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. - Ching-Jong Liao; Hsin-Hui Tsou; Kuo-Ling Huang (Theor. Comput. Sci., 2012)

An empirical evaluation of walk-and-round heuristics for mixed integer linear programs. - Kuo-Ling Huang; Sanjay Mehrotra (Comput. Optim. Appl., 2013)

An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs. - Kuo-Ling Huang; Sanjay Mehrotra (Comput. Optim. Appl., 2015)

Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method. - Kuo-Ling Huang; Sanjay Mehrotra (INFORMS J. Comput., 2017)

Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs. - Manish Bansal; Kuo-Ling Huang; Sanjay Mehrotra (SIAM J. Optim., 2018)

Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs. - Manish Bansal; Kuo-Ling Huang; Sanjay Mehrotra (SIAM J. Optim., 2018)