1. R. Aboudi, A. Hallefjord and K. Jornsten, A facet generation and relaxation technique applied to an assignment problem with side constraints, Eur. J. Oper. Res. 50(1991)335–344.
2. N. Ascheuer, Ein Schnittebenenverfahren fuer ein Reihenfolgeproblem in der flexiblen Fertigung, Diplomarbeit angefertigt, Universität Augsburg, Germany (1989).
3. N. Ascheuer, L.F. Escudero, M. Grötschel and M. Stoer, On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem, in:Integer Programming and Combinatorial Optimization Conf., ed. R. Kannan and W.R. Pulleyblank (Waterloo University Press, Waterloo, Ontario, 1990) pp. 19–28.
4. E. Balas, M. Fischetti and W.R. Pulleyblank, Polyhedral results for the precedence constrained ATSP,Meeting on Combinatorial Optimization, Oberwolfach, Germany (1991).
5. P.M. Camerini, L. Fratta and F. Maffioli, A note on finding optimum branching, Networks 10(1980)81–110.