Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time. - Robert Carr (IPCO, 1996)

Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. - Robert Carr (Math. Oper. Res., 1997)

MDSF - A generic development and simulation facility for flexible, complex robotic systems. - Ou Ma; Kerman Buhariwala; Neil Roger; John Maclean; Robert Carr (Robotica, 1997)

What Industry Wants in Its New Hires. - David Carter; Miriam F. Browning; Robert Carr; Glenn Rosander (CSEE&T, 1998)

A New Bound for the 2-Edge Connected Subgraph Problem. - Robert Carr; R. Ravi 001 (IPCO, 1998)

A new bound for the ratio between the 2-matching problem and its linear programming relaxation. - Sylvia C. Boyd; Robert Carr (Math. Program., 1999)

Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. - Sylvia C. Boyd; Robert Carr (Discret. Optim., 2011)

Decreasing power consumption with energy efficient data aware strategies. - Susan V. Vrbsky; Michael Galloway; Robert Carr; Rahul Nori; David Grubic (Future Gener. Comput. Syst., 2013)

A new integer programming formulation of the graphical traveling salesman problem. - Robert Carr; R. Ravi 001; Neil Simonetti (Math. Program., 2023)

Instance-specific linear relaxations of semidefinite optimization problems. - Daniel de Roux; Robert Carr; R. Ravi 001 (Math. Program. Comput., 2025)