research
∙
10/19/2022
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
The Simplex algorithm for solving linear programs-one of Computing in Sc...
share
research
∙
07/21/2022
The Two-Stripe Symmetric Circulant TSP is in P
The symmetric circulant TSP is a special case of the traveling salesman ...
research
∙
12/22/2020
The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP
Facet-defining inequalities of the symmetric Traveling Salesman Problem ...
research
∙
05/26/2020
Mathematics of Nested Districts: The Case of Alaska
In eight states, a "nesting rule" requires that each state Senate distri...
research
∙
07/26/2019
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...
research
∙
07/21/2019
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
The traveling salesman problem (TSP) is a fundamental problem in combina...
research
∙
02/18/2019
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
We consider the integrality gap of the subtour LP relaxation of the Trav...
research
∙
10/23/2017
