Decomposing finite Abelian groups. - Kevin K. H. Cheung; Michele Mosca (Quantum Inf. Comput., 2001)

On Lov[a-acute]sz–Schrijver Lift-and-Project Procedures on the Dantzig–Fulkerson–Johnson Relaxation of the TSP. - Kevin K. H. Cheung (SIAM J. Optim., 2005)

Facets of the independent path-matching polytope. - Kevin K. H. Cheung (Discret. Optim., 2006)

Optimal 3-terminal cuts and linear programming. - Kevin K. H. Cheung; William H. Cunningham; Lawrence Tang (Math. Program., 2006)

Computation of the Lasserre Ranks of Some Polytopes. - Kevin K. H. Cheung (Math. Oper. Res., 2007)

Solving mirrored traveling tournament problem benchmark instances with eight teams. - Kevin K. H. Cheung (Discret. Optim., 2008)

The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling. - Kevin K. H. Cheung (Oper. Res. Lett., 2008)

A Benders approach for computing lower bounds for the mirrored traveling tournament problem. - Kevin K. H. Cheung (Discret. Optim., 2009)

Maximal planar graphs of inscribable type and diagonal flips. - Kevin K. H. Cheung (Discret. Math., 2009)

Revisiting a simple algorithm for the planar multiterminal cut problem. - Kevin K. H. Cheung; Kyle Harvey (Oper. Res. Lett., 2010)

Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions. - Kevin K. H. Cheung; Babak Moazzez (Adv. Oper. Res., 2016)

Verifying Integer Programming Results. - Kevin K. H. Cheung; Ambros M. Gleixner; Daniel E. Steffy (IPCO, 2017)

Improved approximation of layout problems on random graphs. - Kevin K. H. Cheung; Patrick D. Girardet (CoRR, 2017)

Revisiting a Cutting Plane Method for Perfect Matchings. - Amber Q. Chen; Kevin K. H. Cheung; P. Michael Kielstra; Andrew Winn (CoRR, 2019)

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (IJCAI, 2020)

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (IWOCA, 2020)

A nonexistence certificate for projective planes of order ten with weight 15 codewords. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Dominique Roy; Ilias S. Kotsireas; Vijay Ganesh 001 (Appl. Algebra Eng. Commun. Comput., 2020)

Revisiting a Cutting-Plane Method for Perfect Matchings. - Amber Q. Chen; Kevin K. H. Cheung; P. Michael Kielstra; Avery D. Winn (Open J. Math. Optim., 2020)

A SAT-based Resolution of Lam's Problem. - Curtis Bright; Kevin K. H. Cheung; Brett Stevens; Ilias S. Kotsireas; Vijay Ganesh 001 (AAAI, 2021)

Improving Integer and Constraint Programming for Graeco-Latin Squares. - Noah Rubin; Curtis Bright; Kevin K. H. Cheung; Brett Stevens (ICTAI, 2021)

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. - Noah Rubin; Curtis Bright; Kevin K. H. Cheung; Brett Stevens (CoRR, 2021)

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). - Noah Rubin; Curtis Bright; Brett Stevens; Kevin K. H. Cheung (AAAI, 2022)

A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming. - Kevin K. H. Cheung; Kyel Governor (J. Comb. Optim., 2023)

Unconstrained traveling tournament problem is APX-complete. - Salomon Bendayan; Joseph Cheriyan; Kevin K. H. Cheung (Oper. Res. Lett., 2023)