 | 2009 |
|---|
| 7 |       | Kevin K. H. Cheung:
A Benders approach for computing lower bounds for the mirrored traveling tournament problem.
Discrete Optimization 6(2): 189-196 (2009) |
| 2008 |
|---|
| 6 | | Kevin K. H. Cheung:
Solving mirrored traveling tournament problem benchmark instances with eight teams.
Discrete Optimization 5(1): 138-143 (2008) |
| 5 | | Kevin K. H. Cheung:
The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling.
Oper. Res. Lett. 36(3): 314-316 (2008) |
| 2007 |
|---|
| 4 | | Kevin K. H. Cheung:
Computation of the Lasserre Ranks of Some Polytopes.
Math. Oper. Res. 32(1): 88-94 (2007) |
| 2006 |
|---|
| 3 | | Kevin K. H. Cheung:
Facets of the independent path-matching polytope.
Discrete Optimization 3(2): 111-122 (2006) |
| 2 | | Kevin K. H. Cheung,
William H. Cunningham,
Lawrence Tang:
Optimal 3-terminal cuts and linear programming.
Math. Program. 106(1): 1-23 (2006) |
| 2001 |
|---|
| 1 | | Kevin K. H. Cheung,
Michele Mosca:
Decomposing Finite Abelian Groups
CoRR cs.DS/0101004: (2001) |
