Publications
- K.K.H. Cheung,
A Benders Approach for Computing Improved Lower Bounds
for the Mirrored Traveling Tournament Problem,
Discrete Optimization, 6:189–196, 2009.
(Click
here for the accompanying data and source files.)
- K.K.H. Cheung,
Maximal Planar Graphs of Inscribable Type and Diagonal Flips
,
Discrete Mathematics, doi:10.1016/j.disc.2008.01.038
- K.K.H. Cheung,
The Equivalence of Semidefinite Relaxations of Polynomial 0-1 and ±1
Programs via Scaling,
Operations Research Letters, 36(3):314–316, 2008.
- K.K.H. Cheung,
Solving Mirrored Traveling Tournament Problem Benchmark Instances
with Eight Teams,
Discrete Optimization, 5(1):138–143, 2008.
- K.K.H. Cheung,
Computation of the Lasserre ranks of some polytopes,
Mathematics of Operations Research, 32(1), 88–94, 2007.
- K.K.H. Cheung,
Facets of the independent path-matching polytope,
Discrete Optimization, 3(2):111–122, 2006.
- K.K.H. Cheung, W.H. Cunningham, and L. Tang,
Optimal 3-terminal cuts and linear programming,
Mathematical Programming, 106(1):1–23, 2006.
- K.K.H. Cheung,
On Lovász-Schrijver
Lift-and-Project
Procedures on the Dantzig-Fulkerson-Johnson
Relaxation of the TSP, SIAM Journal on Optimization,
16(2):380–399, 2005.
-
K.K.H. Cheung and M. Mosca,
Decomposing finite abelian groups,
Quantum Inf. Comput., 1(3):26–32, 2001.
Manuscripts
Back to Kevin Cheung's
homepage