( en | de | ru )

 

Disambiguation of "Carr, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
What Industry Wants in Its New Hires.

, , , and . CSEE&T, page 126-127. IEEE Computer Society, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Constance Carr

Hugo Carr

Fritz Carr

Caitriona Carr

Catherine Carr

 

Other publications of authors with the same name

Use of tubular flow reactors for kinetic studies over extended pressure ranges, and . Journal of Physical Chemistry, 75 (10): 1593--601 (1971)What Industry Wants in Its New Hires., , , and . CSEE&T, page 126-127. IEEE Computer Society, (1998)Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time.. IPCO, volume 1084 of Lecture Notes in Computer Science, page 460-474. Springer, (1996)Towards a 4/3 approximation for the asymmetric traveling salesman problem, and . Sandia National Lab.(SNL-NM), Albuquerque, NM (United States); Sandia~…, (1999)MDSF - A generic development and simulation facility for flexible, complex robotic systems., , , , and . Robotica, 15 (1): 49-62 (1997)Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time.. Math. Oper. Res., 22 (2): 257-265 (1997)A new bound for the ratio between the 2-matching problem and its linear programming relaxation., and . Math. Program., 86 (3): 499-514 (1999)Decreasing power consumption with energy efficient data aware strategies., , , , and . Future Gener. Comput. Syst., 29 (5): 1152-1163 (2013)Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, and . Discrete Optimization, 8 (4): 525--539 (2011)A new integer programming formulation of the graphical traveling salesman problem., , and . Math. Program., 197 (2): 877-902 (February 2023)