Samuel C. Gutekunst

Orcid: 0000-0002-3516-2996

According to our database1, Samuel C. Gutekunst authored at least 13 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Circulant TSP special cases: Easily-solvable cases and improved approximations.
Oper. Res. Lett., 2024

2023
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP.
Math. Oper. Res., February, 2023

GILP: An Interactive Tool for Visualizing the Simplex Algorithm.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

2022
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps.
Math. Oper. Res., 2022

GILP: An Interactive Tool for Visualizing the Simplex Algorithm.
CoRR, 2022

The Two-Stripe Symmetric Circulant TSP is in P.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
Root Cones and the Resonance Arrangement.
Electron. J. Comb., 2021

2020
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP.
Oper. Res. Lett., 2020

Mathematics of Nested Districts: The Case of Alaska.
CoRR, 2020

2019
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem.
SIAM J. Discret. Math., 2019

2018
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem.
SIAM J. Optim., 2018

2015
Logarithmic Representability of Integers as k-Sums.
Integers, 2015

2014
Permutation patterns in Latin squares.
Australas. J Comb., 2014


  Loading...