default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin K. H. Cheung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Kevin K. H. Cheung
, Kyel Governor:
A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming. J. Comb. Optim. 45(3): 85 (2023)- [j14]Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung:
Unconstrained traveling tournament problem is APX-complete. Oper. Res. Lett. 51(4): 456-460 (2023) - 2020
- [j13]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh:
A nonexistence certificate for projective planes of order ten with weight 15 codewords. Appl. Algebra Eng. Commun. Comput. 31(3-4): 195-213 (2020) - [j12]Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Avery D. Winn:
Revisiting a Cutting-Plane Method for Perfect Matchings. Open J. Math. Optim. 1: 1-15 (2020) - 2016
- [j11]Kevin K. H. Cheung, Babak Moazzez:
Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions. Adv. Oper. Res. 2016: 5017369:1-5017369:11 (2016) - 2010
- [j10]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
- [j9]Kevin K. H. Cheung:
A Benders approach for computing lower bounds for the mirrored traveling tournament problem. Discret. Optim. 6(2): 189-196 (2009) - [j8]Kevin K. H. Cheung:
Maximal planar graphs of inscribable type and diagonal flips. Discret. Math. 309(4): 920-925 (2009) - 2008
- [j7]Kevin K. H. Cheung:
Solving mirrored traveling tournament problem benchmark instances with eight teams. Discret. Optim. 5(1): 138-143 (2008) - [j6]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
- [j5]Kevin K. H. Cheung:
Computation of the Lasserre Ranks of Some Polytopes. Math. Oper. Res. 32(1): 88-94 (2007) - 2006
- [j4]Kevin K. H. Cheung:
Facets of the independent path-matching polytope. Discret. Optim. 3(2): 111-122 (2006) - [j3]Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang:
Optimal 3-terminal cuts and linear programming. Math. Program. 106(1): 1-23 (2006) - 2005
- [j2]Kevin K. H. Cheung:
On Lov[a-acute]sz--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP. SIAM J. Optim. 16(2): 380-399 (2005) - 2001
- [j1]Kevin K. H. Cheung, Michele Mosca:
Decomposing finite Abelian groups. Quantum Inf. Comput. 1(3): 26-32 (2001)
Conference and Workshop Papers
- 2022
- [c6]Noah Rubin, Curtis Bright, Brett Stevens, Kevin K. H. Cheung:
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract). AAAI 2022: 13037-13038 - 2021
- [c5]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
A SAT-based Resolution of Lam's Problem. AAAI 2021: 3669-3676 - [c4]Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens:
Improving Integer and Constraint Programming for Graeco-Latin Squares. ICTAI 2021: 604-608 - 2020
- [c3]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. IJCAI 2020: 1460-1466 - [c2]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. IWOCA 2020: 97-111 - 2017
- [c1]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. IPCO 2017: 148-160
Informal and Other Publications
- 2022
- [i10]Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung:
Unconstrained Traveling Tournament Problem is APX-complete. CoRR abs/2212.09165 (2022) - 2021
- [i9]Noah Rubin, Curtis Bright, Kevin K. H. Cheung, Brett Stevens:
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares. CoRR abs/2103.11018 (2021) - 2020
- [i8]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem. CoRR abs/2001.11973 (2020) - [i7]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten. CoRR abs/2001.11974 (2020) - [i6]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias S. Kotsireas, Vijay Ganesh:
A SAT-based Resolution of Lam's Problem. CoRR abs/2012.04715 (2020) - 2019
- [i5]Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Andrew Winn:
Revisiting a Cutting Plane Method for Perfect Matchings. CoRR abs/1908.10989 (2019) - [i4]Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh:
A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords. CoRR abs/1911.04032 (2019) - 2017
- [i3]Kevin K. H. Cheung, Patrick D. Girardet:
Improved approximation of layout problems on random graphs. CoRR abs/1710.10339 (2017) - 2016
- [i2]Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. CoRR abs/1611.08832 (2016) - 2001
- [i1]Kevin K. H. Cheung, Michele Mosca:
Decomposing Finite Abelian Groups. CoRR cs.DS/0101004 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
