| 2009 | ||
|---|---|---|
| j13 | Regan Murray, William E. Hart, Cynthia A. Phillips, Jonathan W. Berry, Erik G. Boman, Robert D. Carr, Lee Ann Riesen, Jean-Paul Watson, Terra Haxton, Jonathan G. Herrmann, Robert Janke, George Gray, Thomas Taxon, James G. Uber, Kevin M. Morley: US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water. Interfaces 39(1): 57-68 (2009) | |
| j12 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh: Compacting cuts: A new linear formulation for minimum cut. ACM Transactions on Algorithms 5(3) (2009) | |
| c11 | James E. Levy, Anand Ganti, Cynthia A. Phillips, Benjamin R. Hamlet, Andrew J. Landahl, Thomas M. Gurrieri, Robert D. Carr, Malcolm S. Carroll: Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory. SPAA 2009: 166-168 | |
| 2007 | ||
| c10 | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh: Compacting cuts: a new linear formulation for minimum cut. SODA 2007: 43-52 | |
| 2006 | ||
| j11 | Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips: Robust optimization of contaminant sensor placement for community water systems. Math. Program. 107(1-2): 337-356 (2006) | |
| j10 | Robert D. Carr, Ojas Parekh: A 1/2-integral relaxation for the A-matching problem. Oper. Res. Lett. 34(4): 445-450 (2006) | |
| 2004 | ||
| j9 | Robert D. Carr, Giuseppe Lancia: Compact optimization can outperform separation: A case study in structural proteomics. 4OR 2(3): 221-233 (2004) | |
| j8 | Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz: 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. Journal of Computational Biology 11(1): 27-52 (2004) | |
| j7 | Jean-Loup Faulon, Michael J. Collins, Robert D. Carr: The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences. Journal of Chemical Information and Modeling 44(2): 427-436 (2004) | |
| j6 | Robert D. Carr: Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation. Math. Oper. Res. 29(1): 80-91 (2004) | |
| j5 | Robert D. Carr, Santosh Vempala: On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. Math. Program. 100(3): 569-587 (2004) | |
| c9 | Jean-Loup Faulon, Shawn Martin, Robert D. Carr: Dynamical Robustness in Gene Regulatory Networks. CSB 2004: 626-627 | |
| 2002 | ||
| j4 | Robert D. Carr, Giuseppe Lancia: Compact vs. exponential-size LP relaxations. Oper. Res. Lett. 30(1): 57-65 (2002) | |
| j3 | Robert D. Carr, Santosh Vempala: Randomized metarounding. Random Struct. Algorithms 20(3): 343-352 (2002) | |
| c8 | Robert D. Carr, William E. Hart, Natalio Krasnogor, Jonathan D. Hirst, Edmund K. Burke, James Smith: Alignment Of Protein Structures With A Memetic Evolutionary Algorithm. GECCO 2002: 1027-1034 | |
| 2001 | ||
| j2 | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5(3): 317-326 (2001) | |
| c7 | Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail: 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. RECOMB 2001: 193-202 | |
| 2000 | ||
| j1 | Robert D. Carr: Some Results on Node Lifting of TSP Inequalities. J. Comb. Optim. 4(4): 395-414 (2000) | |
| c6 | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA 2000: 132-142 | |
| c5 | Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips: Strengthening integrality gaps for capacitated network design and covering problems. SODA 2000: 106-115 | |
| c4 | Robert D. Carr, Santosh Vempala, Jacques Mandler: Towards a 4/3 approximation for the asymmetric traveling salesman problem. SODA 2000: 116-125 | |
| c3 | Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe: On the red-blue set cover problem. SODA 2000: 345-353 | |
| c2 | ||
| 1995 | ||
| c1 | Robert D. Carr: Separating Clique Tree and Bipartition Inequalities in Polynominal Time. IPCO 1995: 40-49 | |
Data released under the ODC-BY 1.0 license — See also our legal information page