1. K. Banerjee, “Generalized lagrange multipliers in dynamic programming”, Research Report ORC 71-12, Operations Research Center, University of California, Berkeley (1971).
2. M.S. Bazaraa and J.J. Goode, “A survey of various tactics for generating lagrangian multipliers in the context of lagrangian duality”, unpublished research report in the School of Industrial and Systems Engineering, Georgia Institute of Technology (1974).
3. M.L. Fisher, “Optimal solution of scheduling problems using generalized lagrange multipliers: Part I”,Operations Research 21 (1973) 1114–1127.
4. L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962).
5. A.M. Geoffrion, “Lagrangian relaxation and its uses in integer programming”,Mathematical Programming Study 2 (1974) 82–114.