Samuel C. Gutekunst

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 18

Top Topics

Simplex Algorithm

Traveling Salesman

Integrality Gap

Top Venues

Oper. Res. Lett.

Math. Oper. Res.

Publications

Austin Beal, Yacine Bouabida, Samuel C. Gutekunst, Asta Rustad
Circulant TSP special cases: Easily-solvable cases and improved approximations. Oper. Res. Lett. 55 (2024)
Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. SIGCSE (1) (2023)
Samuel C. Gutekunst, David P. Williamson
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. Math. Oper. Res. 48 (1) (2023)
Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR (2022)
Samuel C. Gutekunst, David P. Williamson
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps. Math. Oper. Res. 47 (1) (2022)
Samuel C. Gutekunst, Billy Jin, David P. Williamson
The Two-Stripe Symmetric Circulant TSP is in P. CoRR (2022)
Samuel C. Gutekunst, Billy Jin, David P. Williamson
The Two-Stripe Symmetric Circulant TSP is in P. IPCO (2022)
Samuel C. Gutekunst, Karola Mészáros, T. Kyle Petersen
Root Cones and the Resonance Arrangement. Electron. J. Comb. 28 (1) (2021)
Samuel C. Gutekunst, David P. Williamson
The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP. CoRR (2020)
Sophia Caldera, Daryl R. DeFord, Moon Duchin, Samuel C. Gutekunst, Cara Nix
Mathematics of Nested Districts: The Case of Alaska. CoRR (2020)
Samuel C. Gutekunst, David P. Williamson
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP. Oper. Res. Lett. 48 (3) (2020)
Samuel C. Gutekunst, David P. Williamson
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem. CoRR (2019)
Samuel C. Gutekunst, David P. Williamson
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP. CoRR (2019)
Samuel C. Gutekunst, David P. Williamson
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem. SIAM J. Discret. Math. 33 (4) (2019)
Samuel C. Gutekunst, David P. Williamson
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps. CoRR (2019)
Samuel C. Gutekunst, David P. Williamson
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem. SIAM J. Optim. 28 (3) (2018)
Samuel C. Gutekunst, David P. Williamson
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem. CoRR (2017)
Anant P. Godbole, Samuel C. Gutekunst, Vince Lyzinski, Yan Zhuang
Logarithmic Representability of Integers as k-Sums. Integers (2015)
Michael J. Earnest, Samuel C. Gutekunst
Permutation patterns in Latin squares. Australas. J Comb. 59 (2014)