Kevin K. H. Cheung

	2010
11		Kevin K. H. Cheung, Kyle Harvey: Revisiting a simple algorithm for the planar multiterminal cut problem. Oper. Res. Lett. 38(4): 334-336 (2010)
	2009
10		Kevin K. H. Cheung: Maximal planar graphs of inscribable type and diagonal flips. Discrete Mathematics 309(4): 920-925 (2009)
9		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
8		Kevin K. H. Cheung: Solving mirrored traveling tournament problem benchmark instances with eight teams. Discrete Optimization 5(1): 138-143 (2008)
7		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
6		Kevin K. H. Cheung: Computation of the Lasserre Ranks of Some Polytopes. Math. Oper. Res. 32(1): 88-94 (2007)
	2006
5		Kevin K. H. Cheung: Facets of the independent path-matching polytope. Discrete Optimization 3(2): 111-122 (2006)
4		Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang: Optimal 3-terminal cuts and linear programming. Math. Program. 106(1): 1-23 (2006)
	2005
3		Kevin K. H. Cheung: On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP. SIAM Journal on Optimization 16(2): 380-399 (2005)
	2001
2		Kevin K. H. Cheung, Michele Mosca: Decomposing Finite Abelian Groups CoRR cs.DS/0101004: (2001)
1		Kevin K. H. Cheung, Michele Mosca: Decomposing finite Abelian groups. Quantum Information & Computation 1(3): 26-32 (2001)

Coauthor Index

1	William H. Cunningham	[4]
2	Kyle Harvey	[11]
3	Michele Mosca	[1] [2]
4	Lawrence Tang	[4]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page