Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling. - Stefan Heinz 001; Wen-Yang Ku; J. Christopher Beck (CPAIOR, 2013)

CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem. - Wen-Yang Ku; Thiago Pinheiro; J. Christopher Beck (CP, 2014)

Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems. - Wen-Yang Ku; J. Christopher Beck (CPAIOR, 2014)

Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems. - Miguel F. Anjos; Xiao-Wen Chang; Wen-Yang Ku (J. Glob. Optim., 2014)

Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem. - Wen-Yang Ku; J. Christopher Beck (CPAIOR, 2015)

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems. - Wen-Yang Ku; J. Christopher Beck (CP, 2016)

ℚ-bounds consistency for the spread constraint with variable mean. - Chee Loong Soon; Wen-Yang Ku; J. Christopher Beck (Constraints An Int. J., 2016)

Mixed Integer Programming models for job shop scheduling: A computational analysis. - Wen-Yang Ku; J. Christopher Beck (Comput. Oper. Res., 2016)

Simulation-based fast collision detection for scaled polyhedral objects in motion by exploiting analytical contact equations. - Jing-Sin Liu; Wen-Hua Pan; Wen-Yang Ku; Y.-H. Tsao; Yau-Zen Chang (Robotica, 2016)