Kevin K. H. Cheung

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 20

Top Topics

Constraint Solver

Constraint Programming

Mixed Integer Linear Programming

Top Venues

Oper. Res. Lett.

Publications

Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung
Unconstrained traveling tournament problem is APX-complete. Oper. Res. Lett. 51 (4) (2023)
Kevin K. H. Cheung, Kyel Governor
A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming. J. Comb. Optim. 45 (3) (2023)
Noah Rubin, Curtis Bright, Brett Stevens, Kevin K. H. Cheung
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). AAAI (2022)
Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung
Unconstrained Traveling Tournament Problem is APX-complete. CoRR (2022)
Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. CoRR (2021)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
A SAT-based Resolution of Lam's Problem. AAAI (2021)
Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens
Improving Integer and Constraint Programming for Graeco-Latin Squares. ICTAI (2021)
Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Avery D. Winn
Revisiting a Cutting-Plane Method for Perfect Matchings. Open J. Math. Optim. 1 (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh
A nonexistence certificate for projective planes of order ten with weight 15 codewords. Appl. Algebra Eng. Commun. Comput. 31 (3-4) (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
A SAT-based Resolution of Lam's Problem. CoRR (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. CoRR (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. IWOCA (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. CoRR (2020)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. IJCAI (2020)
Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Andrew Winn
Revisiting a Cutting Plane Method for Perfect Matchings. CoRR (2019)
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords. CoRR (2019)
Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy
Verifying Integer Programming Results. IPCO (2017)
Kevin K. H. Cheung, Patrick D. Girardet
Improved approximation of layout problems on random graphs. CoRR (2017)
Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy
Verifying Integer Programming Results. CoRR (2016)
Kevin K. H. Cheung, Babak Moazzez
Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions. Adv. Oper. Res. 2016 (2016)
Kevin K. H. Cheung, Kyle Harvey
Revisiting a simple algorithm for the planar multiterminal cut problem. Oper. Res. Lett. 38 (4) (2010)
Kevin K. H. Cheung
Maximal planar graphs of inscribable type and diagonal flips. Discret. Math. 309 (4) (2009)
Kevin K. H. Cheung
A Benders approach for computing lower bounds for the mirrored traveling tournament problem. Discret. Optim. 6 (2) (2009)
Kevin K. H. Cheung
The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling. Oper. Res. Lett. 36 (3) (2008)
Kevin K. H. Cheung
Solving mirrored traveling tournament problem benchmark instances with eight teams. Discret. Optim. 5 (1) (2008)
Kevin K. H. Cheung
Computation of the Lasserre Ranks of Some Polytopes. Math. Oper. Res. 32 (1) (2007)
Kevin K. H. Cheung
Facets of the independent path-matching polytope. Discret. Optim. 3 (2) (2006)
Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
Optimal 3-terminal cuts and linear programming. Math. Program. 106 (1) (2006)
Kevin K. H. Cheung
On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP. SIAM J. Optim. 16 (2) (2005)
Kevin K. H. Cheung, Michele Mosca
Decomposing finite Abelian groups. Quantum Inf. Comput. 1 (3) (2001)
Kevin K. H. Cheung, Michele Mosca
Decomposing Finite Abelian Groups CoRR (2001)