default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert D. Carr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Robert D. Carr, Arash Haddadan, Cynthia A. Phillips:
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. Discret. Optim. 47: 100746 (2023)- [i5]Wayne M. Witzel, Warren D. Craft, Robert D. Carr, Deepak Kapur:
Verifying Quantum Phase Estimation (QPE) using Prove-It. CoRR abs/2304.02183 (2023) - 2021
- [c12]Robert D. Carr, Neil Simonetti
:
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. IPCO 2021: 458-472 - 2020
- [i4]Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley:
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. CoRR abs/2005.11912 (2020) - [i3]Robert D. Carr, Neil Simonetti:
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. CoRR abs/2006.04933 (2020) - [i2]Robert D. Carr, Arash Haddadan, Cynthia A. Phillips:
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. CoRR abs/2006.06957 (2020) - [i1]Wayne M. Witzel, Warren D. Craft, Robert D. Carr, Joaquín E. Madrid Larrañaga:
Prove-It: A Proof Assistant for Organizing and Verifying General Mathematical Knowledge. CoRR abs/2012.10987 (2020)
2010 – 2019
- 2014
- [j15]Robert D. Carr, Giuseppe Lancia:
Ramsey theory and integrality gap for the independent set problem. Oper. Res. Lett. 42(2): 137-139 (2014)
2000 – 2009
- 2009
- [j14]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) - [j13]Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh:
Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms 5(3): 27:1-27:16 (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
- [j12]Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti:
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3(1): 3-19 (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. J. Comput. Biol. 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. J. Chem. Inf. Model. 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 S. 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 S. 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 S. 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]Robert D. Carr, Santosh S. Vempala:
Randomized metarounding (extended abstract). STOC 2000: 58-62
1990 – 1999
- 1995
- [c1]Robert D. Carr:
Separating Clique Tree and Bipartition Inequalities in Polynominal Time. IPCO 1995: 40-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
