Title of article :
On the complexity of the car sequencing problem
Author/Authors :
Tam?s Kis، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2004
Keywords :
computational complexity , Sequencing/scheduling , analysis of algorithms , Pseudo-polynomial algorithms
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
