Journal: Oper. Res. Lett.

Volume 1, Issue 2

43 -- 48George B. Dantzig. Reminiscences about the origins of linear programming
49 -- 51Richard M. Karp. Dynamic programming meets the principle of inclusion and exclusion
52 -- 55J. Carlier, A. H. G. Rinnooy Kan. Scheduling subject to nonrenewable-resource constraints
56 -- 58T. S. Wee, Michael J. Magazine. Assembly line balancing as generalized bin packing
59 -- 62Joseph F. Traub, Henryk Wozniakowski. Complexity of linear programming
63 -- 66Achim Bachem, Ellis L. Johnson, Rainer Schrader. A characterization of minimal valid inequalities for mixed integer programs
67 -- 71Donald W. Hearn. The gap function of a convex program
72 -- 74D. R. Robinson. Algorithms for evaluating the dynamic allocation index
75 -- 78Lee Schruben, Radhika Kulkarni. Some consequences of estimating parameters for the M/M/1 queue
79 -- 81Y. V. Lirov, E. M. Levich. On the brown method of exponential smoothing