1. R.E. Burkard: A General Hungarian Method for the Algebraic Transportation Problem. Discrete Maths. 22 (1978), 219–232.
2. R.E. Burkard und U. Zimmermann: Weakly Admissible Trans formations For Solving Algebraic Assignment and Transportation Problems, to appear in Polyhedral Combina-torics, hrsg. von M.L. Balinski und M. Padberg, Math. Programming Study 8.
3. A.J. Hoffman: On Simple Linear Programming Problems, Proc. of Symp. in Pure Maths. VII, Convexity, American Math. Soc. 1963, 317–327.
4. E.L. Lawler: On Scheduling Problems with Deferral Costs. Man. Sei. 11 (1964), 280–288
5. J.K. Lenstra: Sequencing By Enumerative Methods. Mathematical Centre Tracts 69, Math. Center Amsterdam 1977