#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yu Hin Au
- 2014

- Yu Hin Au, Levent Tunçel
- SIAM J. Discrete Math.
- 2016

We consider lift-and-project methods for combinatorial optimization problems and focus mostly on those lift-and-project methods which generate polyhedral relaxations of the convex hull of integer solutions. We introduce many new variants of Sherali–Adams and Bienstock– Zuckerberg operators. These new operators fill the spectrum of polyhedral… (More)

- Yu Hin Au, Levent Tunçel
- IPCO
- 2011

- Yu Hin Au
- Discrete Mathematics
- 2015

- Yu Hin Au, Levent Tunçel
- Discrete Optimization
- 2009

We study two polyhedral lift-and-project operators (originally proposed by Lovász and Schrijver in 1991) applied to the fractional stable set polytopes. First, we provide characterizations of all valid inequalities generated by these operators. Then, we present some seven-node graphs on which the operator enforcing the symmetry of the matrix variable is… (More)

- Yu Hin Au, Aaron Robertson, Jeffrey Shallit
- ArXiv
- 2008

Independently, Pirillo and Varricchio, Halbeisen and Hungerbühler and Freedman considered the following problem, open since 1992: Does there exist an infinite word w over a finite subset of Z such that w contains no two consecutive blocks of the same length and sum? We consider some variations on this problem in the light of van der Waerden’s theorem on… (More)

- Yu Hin Au, Levent Tunçel
- ArXiv
- 2016

We consider operators acting on convex subsets of the unit hypercube. These operators are used in constructing convex relaxations of combinatorial optimization problems presented as a 0,1 integer programming problem or a 0,1 polynomial optimization problem. Our focus is mostly on operators that, when expressed as a lift-and-project operator, involve the use… (More)

- ‹
- 1
- ›