Strengthening integrality gaps for capacitated network design and covering problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 106-115

  Carr, Robert D ^a   Fleischer, Lisa K ^a   Leung, Vitus J ^a   Phillips, Cynthia A ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGRATION; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CAPACITATED COVERING INTEGER PROGRAMS (IP); LINEAR PROGRAM (LP) RELAXATION; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;

INTEGER PROGRAMMING;

EID: 0033900420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)