Kevin K. H. Cheung - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2023

Unconstrained traveling tournament problem is APX-completeSalomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung. orl, 51(4):456-460, July 2023. [doi]

A detailed introduction to a minimum-cost perfect matching algorithm based on linear programmingKevin K. H. Cheung, Kyel Governor. jco, 45(3):85, April 2023. [doi]

2022

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

2021

A SAT-based Resolution of Lam's ProblemCurtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh. AAAI 2021: 3669-3676 [doi]

Improving Integer and Constraint Programming for Graeco-Latin SquaresNoah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens. ictai 2021: 604-608 [doi]

2020

2017

Verifying Integer Programming ResultsKevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy. ipco 2017: 148-160 [doi]

2016

Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator FunctionsKevin K. H. Cheung, Babak Moazzez. advor, 2016, 2016. [doi]

2010

Revisiting a simple algorithm for the planar multiterminal cut problemKevin K. H. Cheung, Kyle Harvey. orl, 38(4):334-336, 2010. [doi]

2009

A Benders approach for computing lower bounds for the mirrored traveling tournament problemKevin K. H. Cheung. disopt, 6(2):189-196, 2009. [doi]

Maximal planar graphs of inscribable type and diagonal flipsKevin K. H. Cheung. DM, 309(4):920-925, 2009. [doi]

2008

Solving mirrored traveling tournament problem benchmark instances with eight teamsKevin K. H. Cheung. disopt, 5(1):138-143, 2008. [doi]

The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scalingKevin K. H. Cheung. orl, 36(3):314-316, 2008. [doi]

2007

Computation of the Lasserre Ranks of Some PolytopesKevin K. H. Cheung. mor, 32(1):88-94, 2007. [doi]

2006

Optimal 3-terminal cuts and linear programmingKevin K. H. Cheung, William H. Cunningham, Lawrence Tang. mp, 106(1):1-23, 2006. [doi]

Facets of the independent path-matching polytopeKevin K. H. Cheung. disopt, 3(2):111-122, 2006. [doi]

2005

On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSPKevin K. H. Cheung. siamjo, 16(2):380-399, 2005. [doi]

2001

Decomposing finite Abelian groupsKevin K. H. Cheung, Michele Mosca. qic, 1(3):26-32, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL