1. 1. ADOLPHSON D. et HU T. C., Optimal Linear Ordering, S.I.A.M. J. on Applied Math., vol. 25, 1973, p. 403-423.3456180274.90061
2. 2. BAKER K. R., Introduction to Sequencing and Scheduling, New York, Wiley, 1974.
3. 3. BELLMAN R., Dynamic Programming, Princeton, Princeton University Press, 1957.904771205.90002
4. 4. BURKARD R.E. et DERIGS U., Assignment and Matching Problems : Solution Methods with Fortran-Programs, vol. 184, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Heidelberg, New York.6102410436.90069
5. 5. GAREY M. et JOHNSON D. S., Computers and Intractability, A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979.5190660411.68039