On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems

R. N. Uma, Joel Wein, David P. Williamson. On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theoretical Computer Science, 361(2-3):241-256, 2006. [doi]

Abstract

Abstract is missing.