Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions von Cheung, Kevin K. H., Moazzez, Babak

Volltext

Unconstrained traveling tournament problem is APX-complete von Bendayan, Salomon, Cheriyan, Joseph, Cheung, Kevin K.H.

Volltext

A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming von Cheung, Kevin K. H., Governor, Kyel

Volltext

Computation of the Lasserre Ranks of Some Polytopes von Cheung, Kevin K. H

Volltext

Revisiting a simple algorithm for the planar multiterminal cut problem von Cheung, Kevin K.H., Harvey, Kyle

Volltext

Optimal 3-terminal cuts and linear programming von CHEUNG, Kevin K. H, CUNNINGHAM, William H, TANG, Lawrence

Volltext

Maximal planar graphs of inscribable type and diagonal flips von Cheung, Kevin K.H.

Volltext

On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP von Cheung, Kevin K. H.

Volltext

The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling von Cheung, Kevin K.H.

Volltext

Improved Approximation of Layout Problems on Random Graphs von Cheung, Kevin K. H., Girardet, Patrick

Volltext

A SAT-based Resolution of Lam's Problem von Bright, Curtis, Cheung, Kevin K H, Stevens, Brett, Kotsireas, Ilias, Ganesh, Vijay

Volltext

Revisiting a Cutting-Plane Method for Perfect Matchings von Chen, Amber Q., Cheung, Kevin K. H., Kielstra, P. Michael, Winn, Avery D.

Volltext

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten von Bright, Curtis, Cheung, Kevin K H, Stevens, Brett, Kotsireas, Ilias, Ganesh, Vijay

Volltext

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem von Bright, Curtis, Cheung, Kevin K H, Stevens, Brett, Kotsireas, Ilias, Ganesh, Vijay

Volltext

Verifying Integer Programming Results von Cheung, Kevin K H, Ambros Gleixner, Steffy, Daniel E

Volltext

On r-Edge-Connected r-Regular Bricks and Braces and Inscribability von K. H. Cheung, Kevin

Volltext

Verifying Integer Programming Results von Cheung, Kevin K. H., Gleixner, Ambros, Steffy, Daniel E.

Volltext

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten von Bright, Curtis, Cheung, Kevin K. H., Stevens, Brett, Kotsireas, Ilias, Ganesh, Vijay

Volltext

A Benders approach for computing lower bounds for the mirrored traveling tournament problem von Cheung, Kevin K.H.

Volltext

Unconstrained Traveling Tournament Problem is APX-complete von Bendayan, Salomon, Cheriyan, Joseph, Cheung, Kevin K. H

Volltext bestellen