default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel C. Gutekunst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Austin Beal, Yacine Bouabida, Samuel C. Gutekunst, Asta Rustad:
Circulant TSP special cases: Easily-solvable cases and improved approximations. Oper. Res. Lett. 55: 107133 (2024)- 2023
- [j8]Samuel C. Gutekunst
, David P. Williamson:
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. Math. Oper. Res. 48(1): 393-418 (2023) - [c2]Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson:
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. SIGCSE (1) 2023: 108-114 - 2022
- [j7]Samuel C. Gutekunst, David P. Williamson:
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps. Math. Oper. Res. 47(1): 1-28 (2022) - [c1]Samuel C. Gutekunst, Billy Jin, David P. Williamson:
The Two-Stripe Symmetric Circulant TSP is in P. IPCO 2022: 319-332 - [i8]Samuel C. Gutekunst, Billy Jin, David P. Williamson:
The Two-Stripe Symmetric Circulant TSP is in P. CoRR abs/2207.10254 (2022) - [i7]Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson:
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR abs/2210.15655 (2022) - 2021
- [j6]Samuel C. Gutekunst, Karola Mészáros, T. Kyle Petersen:
Root Cones and the Resonance Arrangement. Electron. J. Comb. 28(1): 1 (2021) - 2020
- [j5]Samuel C. Gutekunst, David P. Williamson:
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP. Oper. Res. Lett. 48(3): 245-248 (2020) - [i6]Sophia Caldera, Daryl R. DeFord, Moon Duchin, Samuel C. Gutekunst, Cara Nix:
Mathematics of Nested Districts: The Case of Alaska. CoRR abs/2005.12732 (2020) - [i5]Samuel C. Gutekunst, David P. Williamson:
The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP. CoRR abs/2012.12363 (2020)
2010 – 2019
- 2019
- [j4]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): 2452-2478 (2019) - [i4]Samuel C. Gutekunst, David P. Williamson:
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem. CoRR abs/1902.06808 (2019) - [i3]Samuel C. Gutekunst, David P. Williamson:
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps. CoRR abs/1907.09054 (2019) - [i2]Samuel C. Gutekunst, David P. Williamson:
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP. CoRR abs/1907.11669 (2019) - 2018
- [j3]Samuel C. Gutekunst, David P. Williamson:
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem. SIAM J. Optim. 28(3): 2073-2096 (2018) - 2017
- [i1]Samuel C. Gutekunst, David P. Williamson:
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem. CoRR abs/1710.08455 (2017) - 2015
- [j2]Anant P. Godbole, Samuel C. Gutekunst, Vince Lyzinski, Yan Zhuang:
Logarithmic Representability of Integers as k-Sums. Integers 15A: A5 (2015) - 2014
- [j1]Michael J. Earnest, Samuel C. Gutekunst:
Permutation patterns in Latin squares. Australas. J Comb. 59: 218-228 (2014)
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 2025-01-21 00:23 CET 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:
