Robert D. Carr
Robert D. Carr
Arash Haddadan
Cynthia A. Phillips
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs.
100746
2023
February
47
Discret. Optim.
https://doi.org/10.1016/j.disopt.2022.100746
db/journals/disopt/disopt47.html#CarrHP23
Wayne M. Witzel
Warren D. Craft
Robert D. Carr
Deepak Kapur
Verifying Quantum Phase Estimation (QPE) using Prove-It.
2023
abs/2304.02183
CoRR
https://doi.org/10.48550/arXiv.2304.02183
db/journals/corr/corr2304.html#abs-2304-02183
Robert D. Carr
Neil Simonetti
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem.
458-472
2021
IPCO
https://doi.org/10.1007/978-3-030-73879-2_32
conf/ipco/2021
db/conf/ipco/ipco2021.html#CarrS21
Robert D. Carr
Jennifer Iglesias
Giuseppe Lancia
Benjamin Moseley
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP.
2020
abs/2005.11912
CoRR
https://arxiv.org/abs/2005.11912
db/journals/corr/corr2005.html#abs-2005-11912
Robert D. Carr
Neil Simonetti
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem.
2020
abs/2006.04933
CoRR
https://arxiv.org/abs/2006.04933
db/journals/corr/corr2006.html#abs-2006-04933
Robert D. Carr
Arash Haddadan
Cynthia A. Phillips
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs.
2020
abs/2006.06957
CoRR
https://arxiv.org/abs/2006.06957
db/journals/corr/corr2006.html#abs-2006-06957
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.
2020
abs/2012.10987
CoRR
https://arxiv.org/abs/2012.10987
db/journals/corr/corr2012.html#abs-2012-10987
Robert D. Carr
Giuseppe Lancia
Ramsey theory and integrality gap for the independent set problem.
137-139
2014
42
Oper. Res. Lett.
2
https://doi.org/10.1016/j.orl.2014.01.007
db/journals/orl/orl42.html#CarrL14
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.
57-68
2009
39
Interfaces
1
https://doi.org/10.1287/inte.1080.0415
db/journals/interfaces/interfaces39.html#MurrayHPBBCRWHHJGTUM09
Robert D. Carr
Goran Konjevod
Greg Little
Venkatesh Natarajan
Ojas Parekh
Compacting cuts: A new linear formulation for minimum cut.
2009
5
ACM Trans. Algorithms
3
https://doi.org/10.1145/1541885.1541888
db/journals/talg/talg5.html#CarrKLNP09
27:1-27:16
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.
166-168
2009
SPAA
https://doi.org/10.1145/1583991.1584039
conf/spaa/2009
db/conf/spaa/spaa2009.html#LevyGPHLGCC09
Robert D. Carr
Goran Konjevod
Greg Little
Venkatesh Natarajan
Ojas Parekh
Compacting cuts: a new linear formulation for minimum cut.
43-52
2007
conf/soda/2007
SODA
http://dl.acm.org/citation.cfm?id=1283383.1283389
db/conf/soda/soda2007.html#CarrKLNP07
Egon Balas
Robert D. Carr
Matteo Fischetti
Neil Simonetti
New facets of the STS polytope generated from known facets of the ATS polytope.
3-19
2006
3
Discret. Optim.
1
https://doi.org/10.1016/j.disopt.2005.10.001
db/journals/disopt/disopt3.html#BalasCFS06
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.
337-356
2006
107
Math. Program.
1-2
https://doi.org/10.1007/s10107-005-0689-x
https://www.wikidata.org/entity/Q121888458
db/journals/mp/mp107.html#CarrGHKLLMP06
Robert D. Carr
Ojas Parekh
A 1/2-integral relaxation for the A-matching problem.
445-450
2006
34
Oper. Res. Lett.
4
https://doi.org/10.1016/j.orl.2005.06.004
db/journals/orl/orl34.html#CarrP06
Robert D. Carr
Giuseppe Lancia
Compact optimization can outperform separation: A case study in structural proteomics.
221-233
2004
2
4OR
3
https://doi.org/10.1007/s10288-004-0036-8
db/journals/4or/4or2.html#CarrL04
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.
27-52
2004
11
J. Comput. Biol.
1
https://doi.org/10.1089/106652704773416876
https://www.wikidata.org/entity/Q30341192
db/journals/jcb/jcb11.html#CapraraCILW04
Jean-Loup Faulon
Michael J. Collins 0003
Robert D. Carr
The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences.
427-436
2004
44
J. Chem. Inf. Model.
2
https://doi.org/10.1021/ci0341823
https://www.wikidata.org/entity/Q45023689
db/journals/jcisd/jcisd44.html#FaulonCC04
Robert D. Carr
Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation.
80-91
2004
29
Math. Oper. Res.
1
https://doi.org/10.1287/moor.1030.0058
db/journals/mor/mor29.html#Carr04
Robert D. Carr
Santosh S. Vempala
On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems.
569-587
2004
100
Math. Program.
3
https://doi.org/10.1007/s10107-004-0506-y
db/journals/mp/mp100.html#CarrV04
Jean-Loup Faulon
Shawn Martin
Robert D. Carr
Dynamical Robustness in Gene Regulatory Networks.
626-627
2004
conf/csb/2004
CSB
https://doi.org/10.1109/CSB.2004.1332521
https://doi.ieeecomputersociety.org/10.1109/CSB.2004.1332521
db/conf/csb/csb2004.html#FaulonMC04
Robert D. Carr
Giuseppe Lancia
Compact vs. exponential-size LP relaxations.
57-65
2002
30
Oper. Res. Lett.
1
https://doi.org/10.1016/S0167-6377(01)00106-7
db/journals/orl/orl30.html#CarrL02
Robert D. Carr
Santosh S. Vempala
Randomized metarounding.
343-352
2002
20
Random Struct. Algorithms
3
https://doi.org/10.1002/rsa.10033
db/journals/rsa/rsa20.html#CarrV02
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.
1027-1034
2002
conf/gecco/2002
GECCO
db/conf/gecco/gecco2002.html#CarrHKHBS02
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.
317-326
2001
5
J. Comb. Optim.
3
db/journals/jco/jco5.html#CarrFKP01
https://doi.org/10.1023/A:1011445210568
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.
193-202
2001
conf/recomb/2001
RECOMB
https://doi.org/10.1145/369133.369199
db/conf/recomb/recomb2001.html#LanciaCWI01
Robert D. Carr
Some Results on Node Lifting of TSP Inequalities.
395-414
2000
4
J. Comb. Optim.
4
db/journals/jco/jco4.html#Carr00
https://doi.org/10.1023/A:1009830409833
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.
132-142
2000
conf/esa/2000
ESA
db/conf/esa/esa2000.html#CarrFKP00
https://doi.org/10.1007/3-540-45253-2_13
Robert D. Carr
Lisa Fleischer
Vitus J. Leung
Cynthia A. Phillips
Strengthening integrality gaps for capacitated network design and covering problems.
106-115
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338241
db/conf/soda/soda2000.html#CarrFLP00
Robert D. Carr
Santosh S. Vempala
Jacques Mandler
Towards a 4/3 approximation for the asymmetric traveling salesman problem.
116-125
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338242
db/conf/soda/soda2000.html#CarrVM00
Robert D. Carr
Srinivas Doddi
Goran Konjevod
Madhav V. Marathe
On the red-blue set cover problem.
345-353
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338271
db/conf/soda/soda2000.html#CarrDKM00
Robert D. Carr
Santosh S. Vempala
Randomized metarounding (extended abstract).
58-62
2000
conf/stoc/2000
STOC
https://doi.org/10.1145/335305.335312
db/conf/stoc/stoc2000.html#CarrV00
Robert D. Carr
Separating Clique Tree and Bipartition Inequalities in Polynominal Time.
40-49
1995
conf/ipco/1995
IPCO
db/conf/ipco/ipco1995.html#Carr95
https://doi.org/10.1007/3-540-59408-6_40
Egon Balas
Jonathan W. Berry
Erik G. Boman
Edmund K. Burke
Alberto Caprara
Malcolm S. Carroll
Michael J. Collins 0003
Warren D. Craft
Srinivas Doddi
Jean-Loup Faulon
Matteo Fischetti
Lisa Fleischer
Toshihiro Fujito
Anand Ganti
George Gray
Harvey J. Greenberg
Thomas M. Gurrieri
Arash Haddadan
Benjamin R. Hamlet
William E. Hart
Terra Haxton
Jonathan G. Herrmann
Jonathan D. Hirst
Jennifer Iglesias
Sorin Istrail
Robert Janke
Deepak Kapur
Goran Konjevod
Natalio Krasnogor
Giuseppe Lancia
Andrew J. Landahl
Joaquín E. Madrid Larrañaga
Erik Lauer
Vitus J. Leung
James E. Levy
Henry Lin
Greg Little
Jacques Mandler
Madhav V. Marathe
Shawn Martin
Kevin M. Morley
Tod Morrison
Benjamin Moseley
Regan Murray
Venkatesh Natarajan
Ojas Parekh
Cynthia A. Phillips
Lee Ann Riesen
Neil Simonetti
James Smith
Thomas Taxon
James G. Uber
Santosh S. Vempala
Brian Walenz
Jean-Paul Watson
Wayne M. Witzel