Robert Carr - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2023

A new integer programming formulation of the graphical traveling salesman problemRobert Carr, R. Ravi 0001, Neil Simonetti. mp, 197(2):877-902, February 2023. [doi]

2013

Decreasing power consumption with energy efficient data aware strategiesSusan V. Vrbsky, Michael Galloway, Robert Carr, Rahul Nori, David Grubic. fgcs, 29(5):1152-1163, 2013. [doi]

2011

Finding low cost TSP and 2-matching solutions using certain half-integer subtour verticesSylvia Boyd, Robert Carr. disopt, 8(4):525-539, 2011. [doi]

2006

New facets of the STS polytope generated from known facets of the ATS polytopeEgon Balas, Robert Carr, Matteo Fischetti, Neil Simonetti. disopt, 3(1):3-19, 2006. [doi]

2002

Alignment Of Protein Structures With A Memetic Evolutionary AlgorithmRobert Carr, William Hart, Natalio Krasnogor, Jonathan D. Hirst, Edmund K. Burke, James Smith. gecco 2002: 1027-1034

1999

A new bound for the ratio between the 2-matching problem and its linear programming relaxationSylvia Boyd, Robert Carr. mp, 86(3):499-514, 1999. [doi]

1998

A New Bound for the 2-Edge Connected Subgraph ProblemRobert Carr, R. Ravi. ipco 1998: 112-125 [doi]

What Industry Wants in Its New HiresDavid Carter, Miriam F. Browning, Robert Carr, Glenn Rosander. csee 1998: 126-127 [doi]

1997

Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial TimeRobert Carr. mor, 22(2):257-265, 1997. [doi]

MDSF - A generic development and simulation facility for flexible, complex robotic systemsOu Ma, Kerman Buhariwala, Neil Roger, John Maclean, Robert Carr. robotica, 15(1):49-62, 1997. [doi]

1996

Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal TimeRobert Carr. ipco 1996: 460-474

Sign in or sign up to see more results.

runs on WebDSL