Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Permutation optimale")

Results 1 to 2 of 2

  • Page / 1
Export

Selection :

  • and

COUNTEREXAMPLES TO OPTIMAL PERMUTATION SCHEDULES FOR CERTAIN FLOW SHOP PROBLEMSPANWALKAR SS; SMITH ML; WOOLLAM CR et al.1981; NAV. RES. LOGIST. Q; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 2; PP. 339-340; BIBL. 5 REF.Article

The art of trellis decoding is computationally hard : for large fieldsJAIN, K; MANDOIU, I; VAZIRANI, V. V et al.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 13Conference Paper

  • Page / 1