Kevin K. H. Cheung

Orcid: 0000-0002-4287-1766

According to our database1, Kevin K. H. Cheung authored at least 24 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Unconstrained traveling tournament problem is APX-complete.
Oper. Res. Lett., July, 2023

A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming.
J. Comb. Optim., April, 2023

2022
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract).
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares.
CoRR, 2021

Improving Integer and Constraint Programming for Graeco-Latin Squares.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

A SAT-based Resolution of Lam's Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Revisiting a Cutting-Plane Method for Perfect Matchings.
Open J. Math. Optim., 2020

A nonexistence certificate for projective planes of order ten with weight 15 codewords.
Appl. Algebra Eng. Commun. Comput., 2020

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Revisiting a Cutting Plane Method for Perfect Matchings.
CoRR, 2019

2017
Improved approximation of layout problems on random graphs.
CoRR, 2017

Verifying Integer Programming Results.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions.
Adv. Oper. Res., 2016

2010
Revisiting a simple algorithm for the planar multiterminal cut problem.
Oper. Res. Lett., 2010

2009
Maximal planar graphs of inscribable type and diagonal flips.
Discret. Math., 2009

A Benders approach for computing lower bounds for the mirrored traveling tournament problem.
Discret. Optim., 2009

2008
The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling.
Oper. Res. Lett., 2008

Solving mirrored traveling tournament problem benchmark instances with eight teams.
Discret. Optim., 2008

2007
Computation of the Lasserre Ranks of Some Polytopes.
Math. Oper. Res., 2007

2006
Optimal 3-terminal cuts and linear programming.
Math. Program., 2006

Facets of the independent path-matching polytope.
Discret. Optim., 2006

2005
On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP.
SIAM J. Optim., 2005

2001
Decomposing finite Abelian groups.
Quantum Inf. Comput., 2001


  Loading...