Author image not provided
 Robert D Carr

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article9.74
Citation Count263
Publication count27
Publication years1995-2014
Available for download8
Average downloads per article596.13
Downloads (cumulative)4,769
Downloads (12 Months)112
Downloads (6 Weeks)10
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


27 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 27
Result page: 1 2

Sort by:

1
March 2014 Operations Research Letters: Volume 42 Issue 2, March, 2014
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

We discuss the effectiveness of integer programming for solving large instances of the independent set problem. Typical LP formulations, even strengthened by clique inequalities, yield poor bounds for this problem. We show that a strong bound can be obtained by the use of the so-called rank inequalities, which generalize the ...
Keywords: Integrality gap, ILP formulations, Independent set problem, Ramsey theory

2 published by ACM
August 2009 SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Downloads (Overall): 153

Full text available: PDFPDF
We present and analyze an architecture for a logical qubit memory that is tolerant of faults in the processing of silicon double quantum dot (DQD) qubits. A highlight of our analysis is an in-depth consideration of the constraints faced when integrating DQDs with classical control electronics.
Keywords: classical electronics, quantum architecture, quantum information processsing, logical qubit

3 published by ACM
July 2009 ACM Transactions on Algorithms (TALG): Volume 5 Issue 3, July 2009
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 10,   Downloads (Overall): 462

Full text available: PDFPDF
For a graph ( V , E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V | − 1 polyhedra for minimum s - t cuts in much the same ...
Keywords: Linear programming formulation complexity, minimum cut problem

4
January 2009 Interfaces: Volume 39 Issue 1, January 2009
Publisher: INFORMS
Bibliometrics:
Citation Count: 5

The US Environmental Protection Agency (EPA) is the lead federal agency for the security of drinking water in the United States. The agency is responsible for providing information and technical assistance to the more than 50,000 water utilities across the country. The distributed physical layout of drinking-water utilities makes them ...
Keywords: government services, homeland security, location, water, applications, sensor placement, facilities-equipment planning, integer programming, water security

5
January 2007 SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 249

Full text available: PDFPDF
For a graph ( V, E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V |--1 polyhedra for minimum s-t cuts in much the same way as early approaches to ...

6
July 2006 Operations Research Letters: Volume 34 Issue 4, July, 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

The A-matching problem generalizes matching problems by stipulating that the degree of each vertex lies in a set A"v of admissible values. If these sets have no large ''gaps'', the decision problem is in P, while the complexity of the optimization version is open. We present a polynomial time solvable ...
Keywords: General factor, Matching theory, Polyhedral relaxation, b-matching

7
June 2006 Mathematical Programming: Series A and B: Volume 107 Issue 1, June 2006
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We formulate sensor placement problems as mixed-integer programs, for which the objective coefficients are not known with certainty. We consider a restricted absolute robustness criteria ...

8
June 2006 Mathematical Programming: Series A and B: Volume 107 Issue 1-2, June 2006
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We formulate sensor placement problems as mixed-integer programs, for which the objective coefficients are not known with certainty. We consider a restricted absolute robustness criteria ...

9
March 2006 Discrete Optimization: Volume 3 Issue 1, March, 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

While it had been known for a long time how to transform an asymmetric traveling salesman (ATS) problem on the complete graph with n vertices into a symmetric traveling salesman (STS) problem on an incomplete graph with 2n vertices, no method was available for using this correspondence to derive facets ...
Keywords: CAT inequalities, Inequalities, Curtain inequalities, Lifting, Facets, Asymmetric traveling salesman problem, Cloning, Symmetric traveling salesman problem

10
August 2004 CSB '04: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We investigate the robustness of biological networks, emphasizing gene regulatory networks. We define the robustness of a dynamical network as the magnitude of perturbation in terms of rates and concentrations that will not change the steady state dynamics of the network. We find the number of dynamical networks versus their ...

11
July 2004 Mathematical Programming: Series A and B: Volume 100 Issue 3, July 2004
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

A long-standing conjecture in combinatorial optimization says that the integrality gap of the famous Held-Karp relaxation of the metric STSP (Symmetric Traveling Salesman Problem) is precisely 4/3. In this paper, we show that a slight strengthening of this conjecture implies a tight 4/3 integrality gap for a linear programming relaxation ...

12
July 2004 Mathematical Programming: Series A and B: Volume 100 Issue 3, July 2004
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

A long-standing conjecture in combinatorial optimization says that the integrality gap of the famous Held-Karp relaxation of the metric STSP (Symmetric Traveling Salesman Problem) is precisely 4/3. In this paper, we show that a slight strengthening of this conjecture implies a tight 4/3 integrality gap for a linear programming relaxation ...

13
February 2004 Mathematics of Operations Research: Volume 29 Issue 1, February 2004
Publisher: INFORMS
Bibliometrics:
Citation Count: 3

The problem ofseparating a class of inequalities that are valid for the symmetric traveling salesman problem (STSP) consists of devising an efficient method that, given a fractional pointx*. for a relaxation of the STSP, either finds an inequality in the given class of STSP inequalities that is violated byx*. or ...
Keywords: Lifting, Separation, Node lifting, Symmetric traveling salesman problem, Inequalities, Polyhedron, Polytope

14
July 2002 GECCO '02: Proceedings of the Genetic and Evolutionary Computation Conference
Publisher: Morgan Kaufmann Publishers Inc.
Bibliometrics:
Citation Count: 11


15
May 2002 Random Structures & Algorithms - Probabilistic methods in combinatorial optimization: Volume 20 Issue 3, May 2002
Publisher: John Wiley & Sons, Inc.
Bibliometrics:
Citation Count: 28

Let P be a linear relaxation of an integer polytope Z such that the integrality gap of P with respect to Z is at most r , as verified by a polytime heuristic A , which on any positive cost function c returns an integer solution (an extreme point of ...

16
February 2002 Operations Research Letters: Volume 30 Issue 1, February, 2002
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 6

In this paper, we illustrate by means of examples a technique for formulating compact (i.e. polynomial-size) linear programming relaxations in place of exponential-size models requiring separation algorithms. In the same vein as a celebrated theorem by Grotschel, Lovasz and Schrijver, we state the equivalence of compact separation and compact optimization. ...
Keywords: Compact optimization, Integer program, Linear program, Separation

17 published by ACM
April 2001 RECOMB '01: Proceedings of the fifth annual international conference on Computational biology
Publisher: ACM
Bibliometrics:
Citation Count: 28
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 528

Full text available: PDFPDF
Structure comparison is a fundamental problem for structural genomics. A variety of structure comparison methods were proposed and several protein structure classification servers e.g., SCOP, DALI, CATH, were designed based on them, and are extensively used in practice. This area of research continues to be very active, being energized bi-annually ...

18
September 2000 ESA '00: Proceedings of the 8th Annual European Symposium on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP -Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a ...

19 published by ACM
May 2000 STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 417

Full text available: PDFPDF
Keywords: polyhedra, randomized rounding, integrality gap

20
February 2000 SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 605

Full text available: PDFPDF



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us