
The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space
The Graphical Traveling Salesperson Problem (GTSP) is the problem of ass...
read it

Travelling salesman paths on Demidenko matrices
In the path version of the Travelling Salesman Problem (PathTSP), a sal...
read it

A 3/2Approximation for the Metric Manyvisits Path TSP
In the Manyvisits Path TSP, we are given a set of n cities along with t...
read it

Time and spaceoptimal algorithms for the manyvisits TSP
The manyvisits traveling salesperson problem (MVTSP) asks for an optim...
read it

The time geography of segregation during working hours
Understanding segregation is essential to develop planning tools for bui...
read it

A PolynomialTime Deterministic Approach to the Traveling Salesperson Problem
We propose a new polynomialtime deterministic algorithm that produces a...
read it

City Guarding with Limited Field of View
Drones and other small unmanned aerial vehicles are starting to get perm...
read it
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
In the Traveling Salesman Problem (TSP), a salesman wants to visit a set of cities and return home. There is a cost c_ij of traveling from city i to city j, which is the same in either direction for the Symmetric TSP. The objective is to visit each city exactly once, minimizing total travel costs. In the Graphical TSP, a city may be visited more than once, which may be necessary on a sparse graph. We present a new integer programming formulation for the Graphical TSP requiring only two classes of constraints that are either polynomial in number or polynomially separable, while addressing an open question proposed by Denis Naddef.
READ FULL TEXT
Comments
There are no comments yet.