Robert D. Carr

According to our database¹, Robert D. Carr authored at least 30 papers between 1995 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs.

[BibT_eX]

[DOI]

Robert D. Carr

Arash Haddadan

Cynthia A. Phillips

Discret. Optim., February, 2023

Verifying Quantum Phase Estimation (QPE) using Prove-It.

[BibT_eX]

[DOI]

CoRR, 2023

2021

A New Integer Programming Formulation of the Graphical Traveling Salesman Problem.

[BibT_eX]

[DOI]

Robert D. Carr

Neil Simonetti

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

Prove-It: A Proof Assistant for Organizing and Verifying General Mathematical Knowledge.

[BibT_eX]

[DOI]

Wayne M. Witzel

Warren D. Craft

Robert D. Carr

Joaquín E. Madrid Larrañaga

CoRR, 2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP.

[BibT_eX]

[DOI]

CoRR, 2020

2014

Ramsey theory and integrality gap for the independent set problem.

[BibT_eX]

[DOI]

Robert D. Carr

Giuseppe Lancia

Oper. Res. Lett., 2014

2009

Compacting cuts: A new linear formulation for minimum cut.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.

[BibT_eX]

[DOI]

Interfaces, 2009

Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2006

A 1/2-integral relaxation for the <i>A</i>-matching problem.

[BibT_eX]

[DOI]

Robert D. Carr

Ojas Parekh

Oper. Res. Lett., 2006

Robust optimization of contaminant sensor placement for community water systems.

[BibT_eX]

[DOI]

Math. Program., 2006

New facets of the STS polytope generated from known facets of the ATS polytope.

[BibT_eX]

[DOI]

Discret. Optim., 2006

2004

On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems.

[BibT_eX]

[DOI]

Robert D. Carr

Santosh S. Vempala

Math. Program., 2004

Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation.

[BibT_eX]

[DOI]

Robert D. Carr

Math. Oper. Res., 2004

The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences.

[BibT_eX]

[DOI]

Jean-Loup Faulon

Michael J. Collins

Robert D. Carr

J. Chem. Inf. Model., 2004

1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.

[BibT_eX]

[DOI]

J. Comput. Biol., 2004

Compact optimization can outperform separation: A case study in structural proteomics.

[BibT_eX]

[DOI]

Robert D. Carr

Giuseppe Lancia

4OR, 2004

Dynamical Robustness in Gene Regulatory Networks.

[BibT_eX]

[DOI]

Jean-Loup Faulon

Shawn Martin

Robert D. Carr

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2002

Randomized metarounding.

[BibT_eX]

[DOI]

Robert D. Carr

Santosh S. Vempala

Random Struct. Algorithms, 2002

Compact vs. exponential-size LP relaxations.

[BibT_eX]

[DOI]

Robert D. Carr

Giuseppe Lancia

Oper. Res. Lett., 2002

Alignment Of Protein Structures With A Memetic Evolutionary Algorithm.

[BibT_eX]

Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

2001

A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

2000

Some Results on Node Lifting of TSP Inequalities.

[BibT_eX]

[DOI]

Robert D. Carr

J. Comb. Optim., 2000

Randomized metarounding (extended abstract).

[BibT_eX]

[DOI]

Robert D. Carr

Santosh S. Vempala

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Towards a 4/3 approximation for the asymmetric traveling salesman problem.

[BibT_eX]

[DOI]

Robert D. Carr

Santosh S. Vempala

Jacques Mandler

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Strengthening integrality gaps for capacitated network design and covering problems.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the red-blue set cover problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1995

Separating Clique Tree and Bipartition Inequalities in Polynominal Time.

[BibT_eX]

[DOI]

Robert D. Carr

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Robert D. Carr

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...