Carr Robert

Robert Carr

Information about the author Robert Carr will soon be added to the site.
Found 4 papers in total
Finding low cost TSP and 2‐matching solutions using certain half‐integer subtour vertices
Finding low cost TSP and 2‐matching solutions using certain half‐integer subtour vertices
2011
Consider the traveling salesman problem (TSP) defined on the complete graph, where the...
Separation algorithms for classes of the symmetric traveling salesman problem (STSP) inequalities arising from a new STSP relaxation
Separation algorithms for classes of the symmetric traveling salesman problem (STSP) inequalities arising from a new STSP relaxation
2004
The problem of separating a class of inequalities that are valid for the symmetric...
A ½-integral relaxtion for the A-matching problem
A ½-integral relaxtion for the A-matching problem
2006
The A -matching problem generalizes matching problems by stipulating that the degree...
New facets of the STS polytope generated from known facets of the ATS polytope
New facets of the STS polytope generated from known facets of the ATS polytope
2006
While it had been known for a long time how to transform an asymmetric traveling...
Papers per page: