The following pages link to Robert D. Carr (Q1612002):
Displaying 18 items.
- (Q222487) (redirect page) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- Compact optimization can outperform separation: a case study in structural proteomics (Q1762887) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
- New facets of the STS polytope generated from known facets of the ATS polytope (Q2494809) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- (Q2753930) (← links)
- Compacting cuts (Q2930250) (← links)
- (Q2934581) (← links)
- (Q4452913) (← links)
- (Q4952606) (← links)
- (Q4952637) (← links)
- Separating clique tree and bipartition inequalities in polynomial time (Q5101404) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem (Q5952320) (← links)
- Instance-specific linear relaxations of semidefinite optimization problems (Q6508840) (← links)
