Experimental study of LP-based approximation algorithms for scheduling problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 453-462

  Savelsbergh, Martin W P ^a   Uma, R N ^a   Wein, Joel ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

AVERAGE WEIGHTED COMPLETION TIME;

ALGORITHMS;

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

References (32)