A survey on the continuous nonlinear resource allocation problem

European Journal of Operational Research

Volumn 185, Issue 1, 2008, Pages 1-46

  Patriksson, Michael ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Convex programming; Inventory; Large scale optimization; Logistics; Nonlinear programming

Indexed keywords

ALGORITHMS; ECONOMIC ANALYSIS; LAGRANGE MULTIPLIERS; LOGISTICS; NONLINEAR PROGRAMMING; NONLINEAR SYSTEMS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION; STATISTICS;

CONVEX PROGRAMMING; FINANCIAL ECONOMICS; LARGE SCALE OPTIMIZATION;

RESOURCE ALLOCATION;

EID: 34548670503     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.12.006     Document Type: Article

References (328)

1. Aardal K., and Larsson T. A Benders decomposition based heuristic for the hierarchical production planning problem. European Journal of Operational Research 45 (1990) 4-14
2. Abadie J., and Sakarovitch M. The methods of decomposition for linear programming. In: Kuhn H.W. (Ed). Proceedings of the Princeton Symposium on Mathematical Programming (1970), Princeton University Press, Princeton, NJ 1-23
3. C.C. Aggarwal, J.L. Wolf, P.S. Yu, On optimal batching policies for video-on-demand storage servers, in: Proceedings of the IEEE International Conference on Multimedia Computing and Systems, Hiroshima, Japan, 1996.
4. Agmon S. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 382-392
5. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
6. Ali A.I., Helgason R.V., Kennington J.L., and Lall H. Computational comparisons among three multicommodity flow algorithms. Operations Research 28 (1980) 995-1000
7. Anantharam V. The optimal buffer allocation problem. IEEE Transactions on Information Theory it-35 (1989) 116-126
8. Bacharach M. Biproportional Matrices and Input-Output Change (1970), Cambridge University Press, Cambridge, MA
9. Bachem A., and Korte B. An algorithm for quadratic optimization over transportation polytopes. Zeitschrift für Angewandte Mathematik und Mechanik 58 (1978) T459-T461
10. Bachem A., and Korte B. Minimum norm problems over transportation polytopes. Linear Algebra and Its Applications 31 (1980) 103-118
11. Balinski M.L., and Young H.P. Fair Representation-Meeting the Ideal of One Man, One Vote (1982), Yale University Press, New Haven, CT
12. Barlow R.E., and Proschan F. Mathematical Theory of Reliability (1965), John Wiley & Sons, New York, NY
13. Bauschke H.H., and Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996) 367-426
14. Bazaraa M.S., Goode J.J., and Rardin R.L. An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality. Journal of Mathematical Analysis and Applications 65 (1978) 278-288
15. M.J. Beckmann, A Lagrangian multiplier rule in linear activity analysis and some of its applications, Tech. Rep. Economics No. 2054, Cowles Commission Discussion Paper, Chicago, IL, 1952.
16. Beckmann M.J. On the theory of traffic flow in networks. Traffic Quarterly 21 (1967) 109-117
17. M.J. Beckmann, C.B. McGuire, C.B. Winsten, Studies in the economics of transportation, Research Memorandum RM-1488, The RAND Corporation, Santa Monica, CA, 1955. Available online at the RAND Corporation home page, as the first in a list of RAND Classics. See http://www.rand.org/publications/electronic/class.html.
18. Beckmann M.J., McGuire C.B., and Winsten C.B. Studies in the Economics of Transportation (1956), Yale University Press, New Haven, CT
19. Berman P., Kovoor N., and Pardalos P. Algorithms for the least distance problem. In: Pardalos P. (Ed). Complexity in Numerical Optimization (1993), World Scientific, Singapore 33-56
20. Bernholtz B. Optimum allocation of discharge to units in a hydro-electric generating station. SIAM Review 2 (1960) 247-258
21. Bertsekas D.P., and El Baz D. Distributed asynchronous relaxation methods for convex network flow problems. SIAM Journal on Control and Optimization 25 (1987) 74-85
22. Bertsekas D.P., and Gafni E.M. Projection methods for variational inequalities with application to the traffic assignment problem. Mathematical Programming Study 17 (1982) 139-159
23. Bertsekas D.P., Hosein P.A., and Tseng P. Relaxation methods for network flow problems with convex arc costs. SIAM Journal on Control and Optimization 25 (1987) 1219-1243
24. Bertsekas D.P., and Tsitsiklis J.N. Parallel and Distributed Computation: Numerical Methods (1989), Prentice-Hall, London, UK
25. Bitran G.R., Haas E.A., and Hax A.C. Hierarchical production planning: A single stage system. Operations Research 29 (1981) 717-743
26. Bitran G.R., Haas E.A., and Hax A.C. Hierarchical production planning: A two-stage system. Operations Research 30 (1982) 232-251
27. Bitran G.R., and Hax A.C. On the design of hierarchical production planning systems. Decision Science 8 (1977) 28-55
28. Bitran G.R., and Hax A.C. On the solution of convex knapsack problems with bounded variables. In: Prékopa A. (Ed). Survey of Mathematical Programming vol. 1 (1979), North-Holland, Amsterdam 357-367
29. Bitran G.R., and Hax A.C. Disaggregation and resource-allocation using convex knapsack-problems with bounded variables. Management Science 27 (1981) 431-441
30. Bitran G.R., and Mondschein S.V. Inventory management in catalog sales companies. ORSA Journal on Computing 8 (1996) 274-288
31. Bitran G.R., and Mondschein S.V. Mailing decisions in the catalog sales industry. Management Science 42 (1996) 1364-1381
32. Bitran G.R., and Tirupati D. Tradeoff curves targeting and balancing in manufacturing queueing networks. Operations Research 37 (1989) 547-564
33. Blum M.R., Floyd R.W., Pratt V.R., Rivest R.L., and Tarjan R.E. Time bounds for selection. Journal of Computer and System Sciences 7 (1972) 448-461
34. Bodin L. Optimization procedures for the analysis of coherent structures. IEEE Transactions on Reliability r-18 (1969) 118-126
35. Boot J.C. Binding constraint procedures of quadratic programming. Econometrica 31 (1963) 464-498
36. Boot J.C. Quadratic Programming: Algorithms, Anomalies, Applications. Studies in Mathematical and Managerial Economics vol. 2 (1964), North-Holland, Amsterdam
37. U. Brännlund, On relaxation methods for nonsmooth convex optimization, Ph.D. thesis, Department of mathematics, Royal Institute of Technology, Stockholm, Sweden, 1993.
38. Bregman L.M. Proof of the convergence of Sheliekhovskii's method for a problem with transportation constraints. USSR Computational Mathematics and Mathematical Physics 7 (1967) 191-204
39. Bretthauer K.M. Capacity planning in manufacturing and computer networks. European Journal of Operational Research 91 (1996) 386-394
40. Bretthauer K.M., Ross A., and Shetty B. Nonlinear integer programming for optimal allocation in stratified sampling. European Journal of Operational Research 116 (1999) 667-680
41. Bretthauer K.M., and Shetty B. The nonlinear resource allocation problem. Operations Research 43 (1995) 670-683
42. Bretthauer K.M., and Shetty B. Quadratic resource allocation with generalized upper bounds. Operations Research Letters 20 (1997) 51-57
43. Bretthauer K.M., and Shetty B. A pegging algorithm for the nonlinear resource allocation problem. Computers & Operations Research 29 (2002) 505-527
44. Bretthauer K.M., and Shetty B. The nonlinear knapsack problem-algorithms and applications. European Journal of Operational Research 138 (2002) 459-472
45. Bretthauer K.M., Shetty B., and Syam S. A branch and bound algorithm for integer quadratic knapsack problems. ORSA Journal on Computing 7 (1995) 109-116
46. Bretthauer K.M., Shetty B., and Syam S. A projection method for the integer quadratic knapsack problem. Journal of the Operational Research Society 47 (1996) 457-462
47. Bretthauer K.M., Shetty B., and Syam S. A specially structured nonlinear integer resource allocation problem. Navel Research Logistics 50 (2003) 770-792
48. Bretthauer K.M., Shetty B., Syam S., and White S. A model for resource constrained production and inventory management. Decision Sciences 25 (1994) 561-580
49. Brown S.S. Optimal search for a moving target in discrete time and space. Operations Research 28 (1980) 1275-1289
50. Brucker P. An O(n) algorithm for quadratic knapsack problems. Operations Research Letters 3 (1984) 163-166
51. Buchan J., and Koeningsberg E. Scientific Inventory Management (1963), Prentice-Hall, New Jersey, NJ
52. Calamai P.H., and Moré J.J. Quasi-Newton updates with bounds. SIAM Journal on Numerical Analysis 24 (1987) 1434-1441
53. Censor Y., and Herman G.T. On some optimization techniques in image reconstruction from projections. Applied Numerical Mathematics 3 (1987) 365-391
54. Censor Y., and Lent A. An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications 34 (1981) 321-353
55. Censor Y., and Zenios S.A. Parallel Optimization: Theory, Algorithms, and Applications. Numerical Mathematics and Scientific Computing (1997), Oxford University Press, Oxford, UK
56. Charnes A., and Cooper W.W. Extremal principles for simulating traffic flow in a network. Proceedings of the National Academy of Sciences of the United States of America 44 (1958) 201-204
57. Charnes A., and Cooper W.W. The theory of search: Optimal distribution of search effort. Management Science 5 (1958) 44-49
58. Charnes A., and Cooper W.W. Management Models and Industrial Applications of Linear Programming vol. I (1961), John Wiley & Sons, New York, NY
59. Charnes A., and Cooper W.W. Multicopy traffic network models. In: Herman R. (Ed). Theory of Traffic Flow. Proceedings of the Symposium on the Theory of Traffic Flow Held at the General Motors Research Laboratories, Warren, MI, December 7-8, 1959 (1961), Elsevier, Amsterdam 85-96
60. Charnes A., and Lemke C.E. Minimization of non-linear separable convex functionals. Naval Research Logistics Quarterly 1 (1954) 301-312
61. Churchman C.W., Ackoff R.L., and Arnoff E.L. Introduction to Operations Research. first ed. (1957), John Wiley & Sons, New York, NY
62. Churchman C.W., Ackoff R.L., and Arnoff E.L. Introduction to Operations Research. fifth ed. (1971), John Wiley & Sons, New York, NY
63. Cochran W.G. Sampling Techniques. third ed. (1977), John Wiley & Sons, New York, NY
64. Cochran W.G. Sampling Techniques (1963), John Wiley & Sons, New York, NY
65. Coleman T.F., and Hulbert L.A. A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds. SIAM Journal on Optimization 3 (1993) 298-321
66. L. Cooper, J.L. Kennington, Steady-state analysis of nonlinear resistive electrical networks using optimization techniques, Technical Report IEOR 77012, Department of Operations Research and Engineering Management, School of Engineering and Applied Science, Southern Methodist University, Dallas, TX, 1977.
67. Correa J.R., Schulz A.S., and Stier Moses N.E. Selfish routing in capacitated networks. Mathematics of Operations Research 29 (2004) 961-976
68. Cosares S., and Hochbaum D.S. Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Mathematics of Operations Research 19 (1994) 94-111
69. Côte G., and Laughton M.A. Large-scale integer programming: Benders-type heuristics. European Journal of Operational Research 16 (1984) 327-333
70. Cottle R.W. Monotone solutions of the parametric linear complementarity problems. Mathematical Programming 3 (1972) 210-224
71. Cottle R.W. Application of a block successive overrelaxation method to a class of constrained matrix problems. In: Cottle R.W., Kelmanson M.L., and Korte B. (Eds). Mathematical Programming (1984), North-Holland, Amsterdam 89-103
72. Cottle R.W., Duvall S.G., and Zikan K. A Lagrangean relaxation algorithm for the constrained matrix problem. Naval Research Logistics Quarterly 33 (1986) 55-76
73. Cottle R.W., and Pang J.-S. On the convergence of a block successive over-relaxation method for a class of linear complementarity problems. Mathematical Programming Study 17 (1982) 126-138
74. Cryer C.W. The solution of a quadratic programming problem using systematic overrelaxation. SIAM Journal on Control 9 (1971) 385-392
75. Curet N.D. On the dual coordinate ascent approach for nonlinear networks. Computers and Operations Research 20 (1993) 133-140
76. Dafermos S., and Nagurney A. Supply and demand equilibration algorithms for a class of market equilibrium problems. Transportation Science (1989) 118-124
77. Dafermos S., and Sparrow F.T. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards 73B (1969) 91-118
78. Dai Y.-H., and Fletcher R. New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Mathematical Programming 106 (2006) 403-421
79. Danskin J.M. A game theory model of convoy routing. Operations Research 10 (1962) 774-785
80. Danskin J.M. A theory of reconnaissance: I. Operations Research 10 (1962) 285-299
81. Danskin J.M. A theory of reconnaissance: I. Operations Research 10 (1962) 300-309
82. Danskin J.M. The theory of max-min with applications. SIAM Journal on Applied Mathematics 14 (1966) 641-664
83. Danskin J.M. The Theory of Max-Min and Its Application to Weapons Allocation Problems (1967), Springer-Verlag, Berlin
84. de Guenin J. Optimal distribution of effort: An extension of the Koopman basic theory. Operations Research 9 (1961) 1-7
85. Debiesse J.L., and Matignon G. Comparison of different methods for the calculation of traffic matrices. Annales des Telecommuncations 35 (1980) 91-102
86. Deming W.E., and Stephan F.F. On a least-squares adjustment of a sampled frequency table when the expected marginal totals are known. Annals of Mathematical Statistics 11 (1940) 427-444
87. D'Esopo D. A convex programming procedure. Naval Research Logistics 6 (1959) 33-42
88. Djerdjour M., Mathur K., and Salkin H.M. A surrogate relaxation based algorithm for a general quadratic multidimensional knapsack problem. Operations Research Letters 7 (1988) 253-258
89. Dunstan F.D.J. An algorithm for solving a resource allocation problem. Operational Research Quarterly 28 (1977) 839-851
90. Dupuit J. De la mesure de l'utilité des travaux publics. Annales des Ponts et Chaussées 8 (1844) 332-375 English translation by R.H. Barback as On the measurement of the utility of public works, in: (Eds.), A.T. Peacock, R. Turvey, F.A. Lutz, E. Henderson, International Economic Papers 2, Macmillan, London, UK, 1952, pp. 83-110; translation reprinted in [Mun68, pp. 19-57]
91. J. Dupuit, On tolls and transport charges, (1849). Reprinted in International Economics Papers 11 (1962) 7-31.
92. Dussault J.-P., Ferland J.A., and Lemaire B. Convex quadratic programming with one constraint and bounded variables. Mathematical Programming 36 (1986) 90-104
93. Einbu J.M. Extension of the Luss-Gupta resource allocation algorithm by means of first order approximation techniques. Operations Research 29 (1981) 621-626
94. El-Hawary M.E., and Christensen G.S. Optimal Economic Operation of Electric Power Systems (1979), Academic Press, New York, NY
95. Elton E.J., Gruber M.J., and Padberg M.W. Simple criteria for optimal portfolio selection. The Journal of Finance 31 (1976) 1341-1357
96. Erlander S., and Stewart N.F. The Gravity Model in Transportation Analysis: Theory and Extensions. Topics in Transportation vol. 3 (1990), VSP, Utrecht, The Netherlands
97. Eu J.H. An evaluation of error performance estimation schemes for DS1 transmission systems carrying live traffic. IEEE Transactions on Communications 38 (1990) 384-391
98. Eu J.H. The sampling resource allocation problem. IEEE Transactions on Communications 39 (1991) 1277-1279
99. Evans S.P., and Kirby H.R. A three-dimensional Furness procedure for calibrating gravity models. Transportation Research 8 (1974) 105-122
100. Everett III H. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Operations Research 11 (1963) 399-417
101. Federgruen A., and Groenevelt H. Optimal flows in networks with multiple sources sinks, with applications to oil and gas lease investment programs. Operations Research 34 (1986) 218-225
102. Federgruen A., and Zipkin P. Solution techniques for some allocation problems. Mathematical Programming 25 (1983) 13-24
103. Federgruen A., and Zipkin P. A combined vehicle routing inventory allocation problem. Operations Research 32 (1984) 1019-1037
104. J.A. Ferland, B. Lemaire, P. Robert, Analytic solutions for non-linear programs with one or two equality constraints, Publication # 285, Département d'informatique et de recherche opérationnelle, Université de Montréal, Montréal, Canada, 1978.
105. R. Fetter, Modeling health care delivery systems, WP 30, Health Services Research Program, Yale University, 1973.
106. Figueiredo I.N., Júdice J.J., and Rosa S.S. A class of mathematical programs with equilibrium constraints: A smooth algorithm and applications to contact problems. Optimization and Engineering 6 (2005) 203-239
107. Ford Jr. L.R., and Fulkerson D.R. A suggested computation for maximal multi-commodity network flows. Management Science 5 (1958) 97-101
108. Ford Jr. L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
109. R.L. Francis, A "uniformity principle" for evacuation route allocation, working paper, Center for Applied Mathematics, National Bureau of Standards, Department of Commerce, Washington, DC, 1978.
110. Friedlander D. A technique for estimating a contingency table given the marginal totals and some supplementary data. Journal of the Royal Statistics Society A 124 (1961) 412-420
111. K.P. Furness, Trip forecasting. Unpublished note, 1962.
112. Furness K.P. Time function interaction. Traffic Engineering & Control 7 (1970) 19-36
113. Gallo G., Hammer P.L., and Simeone B. Quadratic knapsack problems. Mathematical Programming 12 (1980) 132-149
114. Geoffrion A.M. An improved implicit enumeration approach for integer programming. Operations Research 17 (1969) 437-454
115. Geoffrion A.M. Elements of large-scale mathematical programming. Part I: Concepts. Management Science 16 (1970) 652-675 Reprinted in [Geo72], pp. 25-48
116. Geoffrion A.M. Elements of large-scale mathematical programming. Part II: Synthesis of algorithms and bibliography. Management Science 16 (1970) 691-767
117. Geoffrion A.M. Primal resource-directive approaches for optimizing nonlinear decomposable systems. Operations Research 18 (1970) 375-403
118. Geoffrion A.M. Duality in nonlinear programming: A simplified applications-oriented development. SIAM Review 13 (1971) 65-101 Reprinted in [Geo72]
119. Geoffrion A.M. Perspectives on Optimization: A Collection of Expository Articles (1972), Addison-Wesley, Reading, MA
120. Gerla M., and Kleinrock L. On the topological design of distributed computer networks. IEEE Transactions on Communications com-25 (1977) 48-60
121. Gibbs J.W. Abstract of the Equilibrium of heterogeneous substances. American Journal of Science Serie 3 16 (1978) 441-458
122. Gibbs J.W. On the equilibrium of heterogeneous substances. Transactions of the Connecticut Academy of Arts and Sciences III (1877-1878) 343-524 Reprinted in The Scientific Papers of J. Willard Gibbs, Vol. I: Thermodynamics, Longman, 1906; Dover, 1961, pp. 55-353
123. Gibbs J.W. On the equilibrium of heterogeneous substances. Transactions of the Connecticut Academy of Arts and Sciences III (1875-1876) 108-248 Also in The American Journal of Science and Arts (eds. James D. and E.S. Dana, and B. Silliman), Third Series, vol. XVI, no. 96, December 1878. Reprinted in The Scientific Papers of J. Willard Gibbs, Vol. I: Thermodynamics, Longman, 1906; Dover, 1961, pp. 55-353
124. Glasserman P. Allocating production capacity among multiple products. Operations Research 44 (1996) 724-734
125. Glassey C.R. A quadratic network optimization model for equilibrium of single commodity trade flows. Mathematical Programming 14 (1978) 98-107
126. Glover F. Surrogate constraints. Operations Research 16 (1968) 741-749
127. Goffin J.-L. Nondifferentiable optimization and the relaxation method. In: Lemaréchal C., and Mifflin R. (Eds). Nonsmooth Optimization (1978), IIASA, Pergamon Press, Oxford, UK 31-49
128. H.H. Gossen, Die Entwicklung der Gesetze des menschlichen Verkehrs und der daraus fliessenden Regeln für menschliches Handeln, Friedrich Vieweg und Sohn, Braunschweig, Germany, 1854.
129. Gossen H.H. The Laws of Human Relations and the Rules of Human Action Derived Therefrom. [Trans. R.C. Blitz] (1983), The MIT Press, Cambridge, MA
130. Grad J. Matrix balancing. Computing Journal 14 (1971) 280-284
131. Greenberg H.J. An application of a Lagrangian penalty function to obtain optimal redundancy. Technometrics 12 (1970) 545-552
132. Greenberg H.J., and Pierskalla W.P. Surrogate mathematical programming. Operations Research 18 (1970) 924-939
133. Grotzinger S.J., Srinivasan R., Akella R., and Bollapragada S. Component procurement and allocation for products assembled to forecast: Risk-pooling effects. IBM Journal of Research and Development 37 (1993) 523-535
134. Hadley G., and Whitin T.M. Analysis of Inventory Systems (1963), Prentice-Hall, Englewood Cliffs, NJ
135. Hager W.W., and Hearn D.W. Application of the dual active set algorithm to quadratic network optimization. Computational Optimization and Applications 1 (1993) 349-373
136. Hager W.W., and Park S. The gradient projection method with exact line searches. Journal of Global Optimization 30 (2004) 103-118
137. Hanssman F. Operations Research Techniques for Capital Investment (1968), John Wiley & Sons, New York, NY
138. F.W. Harris, How many parts to make at once, Factory, The Magazine of Management, 1913. Reprinted in Operations Research 38 (1990) 947-950.
139. Harris F.W. Operations and Cost. Factory Management Series (1915), A.W. Shaw & Co., Chicago, IL
140. Hax A.C., and Candea D. Production and Inventory Management (1984), Prentice-Hall, Englewood Cliffs, NJ
141. Held M., Wolfe P., and Crowder H.P. Validation of subgradient optimization. Mathematical Programming 6 (1974) 62-88
142. Helgason R.V., Kennington J.L., and Lall H. A polynomially bounded algorithm for a singly constrained quadratic program. Mathematical Programming 18 (1980) 338-343
143. Herman G.T. Image Reconstruction from Projections: The Fundamentals of Computerized Tomography. Computer Science and Applied Mathematics (1980), Academic Press, New York, NY
144. Hildreth C. A quadratic programming procedure. Naval Research Logistics Quarterly 4 (1957) 79-85 Erratum, Naval Research Logistics Quarterly 4 (1957) 361
145. Hochbaum D.S. Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Mathematics of Operations Research 19 (1994) 390-409
146. Hochbaum D.S. A nonlinear knapsack problem. Operations Research Letters 17 (1995) 103-110
147. Hochbaum D.S., and Hong S.-P. About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming 69 (1995) 269-309
148. Hohzaki R., and Iida K. Efficient algorithms for a convex programming problem with a constraint on the weighted total amount. Mathematica Japonica 52 (1999) 131-142
149. Holt C.C., Modigliani F., Moth J., and Simon H. Planning Production, Inventories and Work Force (1960), Prentice-Hall, New Jersey, NJ
150. Horst R. On reducing a resource allocation problem to a single one-dimensional minimization of a differentiable convex function. Journal of the Operational Research Society 32 (1981) 821-824
151. Ibaraki T., and Katoh N. Resource Allocation Problems: Algorithmic Approaches. Foundations of Computing Series no. 4 (1988), The MIT Press, Cambridge, MA
152. Jefferson T.R., and Scott C.H. The analysis of entropy models with equality and inequality constraints. Transportation Research 13B (1979) 123-132
153. John F. Extremum problems with inequalities as subsidiary conditions. Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948 (1948), Interscience Publishers, Inc., New York, NY 187-204
154. Johnson L.A., and Montgomery D. Operations Research in Production Planning, Scheduling, and Inventory Control (1974), John Wiley & Sons, New York, NY
155. Jucker J.V., and de Faro C. A simple algorithm for Stone's version of the portfolio selection problem. Journal of Financial and Quantitative Analysis (1975)
156. W. Karush, Minima of functions of several variables with inequalities as side constraints, Master's thesis, Department of Mathematics, University of Chicago, Chicago, IL, 1939.
157. Karush W. On a class of minimum cost problems. Management Science 4 (1958) 136-153
158. Karush W. A general algorithm for the optimal distribution of effort. Management Science 9 (1962) 50-72
159. Karwan M.H., and Rardin R.L. Some relations between Lagrangean and surrogate duality in integer programming. Mathematical Programming 17 (1979) 320-334
160. Katoh N., and Ibaraki T. Resource allocation problems. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. 2 (1998), Kluwer Academic Publishers., Amsterdam 159-260
161. Katoh N., Ibaraki T., and Mine H. A polynomial time algorithm for the resource allocation problem with a convex objective function. Journal of the Operational Research Society 30 (1979) 449-455
162. Kennington J.L., and Shalaby M. An effective subgradient procedure for minimal cost multicommodity flow problems. Management Science 23 (1977) 994-1004
163. Kettelle Jr. J.D. Least-cost allocations of reliability investment. Operations Research 10 (1962) 249-265
164. Kish L. Survey Sampling (1965), John Wiley & Sons, New York, NY
165. Kiwiel K.C. The efficiency of subgradient projection methods for convex optimization, Part I: General level methods. SIAM Journal on Control and Optimization 34 (1996) 660-676
166. Kiwiel K.C. The efficiency of subgradient projection methods for convex optimization, Part II: Implementations and extensions. SIAM Journal on Control and Optimization 34 (1996) 677-6697
167. Kiwiel K.C., Lindberg P.O., and Nöu A. Bregman proximal relaxation of large-scale 0-1 problems. Computational Optimization and Applications 15 (2000) 33-44
168. Klein B. Direct use of extremal principles in solving certain optimization problems involving inequalities. Journal of the Operations Research Society of America 3 (1955) 168-175
169. Kleinrock L. Queueing Systems vol. II (1976), John Wiley & Sons, New York, NY
170. Klingman D., Napier A., and Stuts J. NETGEN: A program for generating large-scale capacitated assignment transportation and minimum cost network flow problems. Management Science 20 (1974) 814-821
171. Knight F.H. Some fallacies in the interpretation of social cost. Quarterly Journal of Economics 38 (1924) 582-606 Reprinted in The Ethics of Competition, pp. 217-236, Harper, New York, NY, 1935; and in American Economic Association, Readings in Price Theory, pp. 160-179, Richard D. Irwin, Chicago, IL, 1952
172. Knuth D.E. The Art of Computer Programming. Fundamental Algorithms of Addison-Wesley Series in Computer Science and Information Processing vol. 1 (1968), Addison-Wesley, Reading, MA
173. Knuth D.E. The Art of Computer Programming. Sorting and Searching of Addison-Wesley Series in Computer Science and Information Processing vol. 3 (1973), Addison-Wesley, Reading, MA
174. Kodialam M.S., and Luss H. Algorithms for separable nonlinear resource allocation problems. Operations Research 46 (1998) 272-284
175. B.O. Koopman, Search and screening, OEG Report 56, Operations Evaluations Group, Office of the Chief of Naval Operations, US Navy Department, Washington, DC, 1946. Reprinted in [Koo80].
176. Koopman B.O. New mathematical models in operations research. Journal of the Operations Research Society of America 1 (1952) 3-9
177. Koopman B.O. The optimum distribution of effort. Operations Research 1 (1953) 52-63
178. Koopman B.O. The distribution of searching effort. Journal of the Operations Research Society of America 2 (1954)
179. Koopman B.O. The fallacies of operations research. Operations Research 4 (1956) 422-426 comments by Charles Hitch, 426-430
180. Koopman B.O. The theory of search I: Kinematic bases. Operations Research 4 (1956) 324-346
181. Koopman B.O. The theory of search, II: Target detection. Operations Research 4 (1956) 503-531
182. Koopman B.O. The theory of search, III: The optimum distribution of effort. Operations Research 5 (1957) 613-626
183. Koopman B.O. Search. Operations Research Center, M.I.T. Notes on Operations Research 1959 (1959), The Technology Press, Cambridge, MA 40-83
184. Koopman B.O. An operational critique of detection laws. Operations Research 27 (1979) 115-133
185. Koopman B.O. Search and its optimization. American Mathematical Monthly 86 (1979) 527-540
186. Koopman B.O. Search and Screening. General Principles With Historical Applications. second ed. (1980), Pergamon Press Inc., Elmsford, NY
187. Koopman B.O. Search and Screening. General Principles With Historical Applications. revised ed. (1999), Military Operations Research Society, Alexandria, VA
188. Kotler P. Marketing Decision Making: A Model Building Approach (1971), Holt, Rinehart and Winston, New York, NY
189. Kruithof J. Telefoonverkeersrekening. De Ingenieur 52 (1937) E15-E25 English translation, Calculation of telephone traffic, by UK Post Office Research Department Library, No. 2663, Dollis Hill, London, UK
190. Kuhn H.W., and Tucker A.W. Nonlinear programming. In: Neyman J. (Ed). Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability (1951), University of California Press, Berkeley, CA 481-492
191. Lamond B., and Stewart N.F. Bregman's balancing method. Transportation Research 15B (1981) 239-248
192. Larsson T., and Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 26 (1992) 4-17
193. Larsson T., Patriksson M., and Strömberg A.-B. Conditional subgradient optimization-theory and applications. European Journal of Operational Research 88 (1996) 382-403
194. Lasdon L.S. Optimization Theory for Large Systems (1970), Macmillan, New York, NY
195. Laughhunn D.J. Quadratic binary programming with application to capital-budgeting problems. Operations Research 18 (1970) 454-461
196. Lee H.L., and Pierskalla W.P. Mass screening models for contagious diseases with no latent period. Operations Research 36 (1988) 917-928
197. Lemaréchal C., Nemirovskii A.S., and Nesterov Yu. New variants of bundle methods. Mathematical Programming 69 (1995) 111-147
198. Lewis C.D. Scientific Inventory Control (1981), John Wiley & Sons, New York, NY
199. Lin Y.Y., and Pang J.-S. Iterative methods for large convex quadratic programs: A survey. SIAM Journal on Control and Optimization 25 (1987) 383-411
200. Loane E.P. An algorithm to solve finite separable single-constrained optimization problems. Operations Research 19 (1971) 1477-1493
201. Lotito P.A. Issues in the implementation of the DSD algorithm for the traffic assignment problem. European Journal of Operational Research 175 (2006) 1577-1587
202. Lukka M. On the optimal searching tracks for a moving target. SIAM Journal on Applied Mathematics 32 (1977) 126-132
203. H. Luss, Mathematical models for marketing effort allocation, Ph.D. thesis, Department of Statistics and Operations Research, University of Pennsylvania, Philadelphia, PA, 1973.
204. Luss H. An algorithm for separable nonlinear minimax problems. Operations Research Letters 6 (1987) 159-162
205. Luss H. A nonlinear minimax allocation problem with multiple knapsack constraints. Operations Research Letters 10 (1991) 183-187
206. Luss H. Minimax resource allocation problems: Optimization and parametric analysis. European Journal of Operational Research 60 (1992) 76-86
207. Luss H., and Gupta S.K. Allocation of effort resources among competing activities. Operations Research 23 (1975) 360-366
208. Luss H., and Smith D.R. Resource allocation among competing activities: A lexicographic minimax approach. Operations Research Letters 5 (1986) 227-331
209. Macgill S.H. Convergence and related properties for a modified biproportional problem. Environment and Planning 11A (1979) 499-506
210. n. Operations Research Letters 8 (1989) 219-222
211. n. RAIRO Recherche Opérationnelle 31 (1997) 6-17
212. n. Journal of Optimization Theory and Applications 117 (2003) 553-574
213. Maloney B.M., and Klein C.M. Constrained multi-item inventory systems: An implicit approach. Computers & Operations Research 20 (1993) 639-649
214. Mangel M. Probability of success in the search for a moving target. Operations Research 30 (1982) 216-222
215. Markowitz H.M. Portfolio selection. Journal of Finance 7 (1952) 77-91
216. Markowitz H.M. Portfolio Selection: Efficient Diversification of Investments. Monograph of Cowles Foundation for Research in Economics at Yale University vol. 16 (1959), John Wiley & Sons, New York, NY
217. Mathur K., Salkin H.M., and Mohanty B.B. A note on a general non-linear knapsack problem. Operations Research Letters 5 (1986) 79-81
218. Mathur K., Salkin H.M., and Morito S. A branch and search algorithm for some separable quadratic programming problems. Operations Research Letters 2 (1983) 155-160
219. C.J. McCallum Jr, An algorithm for certain quadratic integer programs, Technical Report, Bell Laboratories, Holmdel, NJ, undated.
220. R.K. McCord, Minimization with one linear equality constraint and bounds on the variables, Technical Report 79-20, System Optimization Library, Department of Operations Research, Stanford University, Stanford, CA, 1979.
221. Megiddo N., and Tamir A. Linear time algorithms for some separable quadratic programming problems. Operations Research Letters 13 (1993) 203-211
222. Mehra J. Josiah Willard Gibbs and the foundations of statistical mechanics. Foundations of Physics 28 (1998) 1785-1815
223. Melman A., and Rabinowitz G. An efficient method for a class of continuous nonlinear knapsack problems. SIAM Review 42 (2000) 440-448
224. Meyer R.R. Multipoint methods for separable nonlinear networks. Mathematical Programming Study 22 (1984) 185-205
225. n. Journal of Optimization Theory and Applications 50 (1986) 195-200
226. M. Minoux, Un algorithme de sous-gradient por l'extrapolation des matrices de traffic pour une norme quadratique, internal note, CNET, Issy, France, 1978.
227. Minoux M. A polynomial algorithm for minimum quadratic cost flow problems. European Journal of Operational Research 18 (1984) 377-387
228. Moré J.J., and Vavasis S.A. On the solution of concave knapsack problems. Mathematical Programming 49 (1991) 397-411
229. Motzkin T., and Schoenberg I.J. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 393-404
230. Mulvey J.M., and Vladimirou H. Solving multistage stochastic networks: An application of scenario aggregation. Networks 21 (1991) 619-643
231. In: Munby D. (Ed). Transport: Selected Readings (1968), Penguin Books, Harmondsworth, Middlesex, England
232. J.D. Murchland, The multiproportional problem, Manuscript JDM-263, Draft 1, Transport Studies Group, University College London, London, UK, 1977.
233. Nagurney A. An algorithm for the classical spatial price equilibrium problem. Operations Research Letters 6 (1987) 93-98
234. Nagurney A., Eyedeland A., and Kim D.-S. Computation of large scale constrained matrix problems: The splitting equilibration algorithm. Proceedings of the 1990 ACM/IEEE conference on Supercomputing, New York, November 12-16, 1990 (1990), IEEE Computer Society, New York, NY 214-223
235. Nagurney A., Kim D.S., and Robinson A.G. Serial and parallel equilibration of large-scale constrained matrix problems with application to the social and economic sciences. The International Journal of Supercomputer Applications 4 (1990) 49-71
236. Nagurney A., and Robinson A.G. Algorithms for quadratic constrained matrix problems. Mathematical and Computer Modelling 16 (1992) 53-65
237. Neyman J. On the two different aspects of the representative method: the method of stratified sampling and the method of purposive selection. Journal of the Royal Statistical Society 97 (1934) 558-606
238. Nielsen S.S., and Zenios S.A. Massively parallel algorithms for singly constrained convex programs. ORSA Journal on Computing 4 (1992) 166-181
239. Nielsen S.S., and Zenios S.A. A massively parallel algorithm for nonlinear stochastic network problems. Operations Research 41 (1993) 319-337
240. Ohtera H., and Yamada S. Optimal allocation & control problems with substitutions. IEEE Transactions on Reliability 39 (1990) 171-176
241. Ohuchi A., and Kaji I. Algorithms for optimal allocation problems having quadratic objective function. Journal of the Operations Research Society of Japan 23 (1980) 64-80
242. Ohuchi A., and Kaji I. An algorithm for the Hitchcock transportation problems with quadratic cost functions. Journal of the Operations Research Society of Japan 24 (1981) 170-182
243. Ohuchi A., and Kaji I. Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs. Networks 14 (1984) 515-530
244. F.H. Omar, The projection of input-output coefficients with application to the United Kingdom, Ph.D. thesis, University of Nottingham, Nottingham, UK, 1967.
245. Oohori T., Ohuchi A., and Kaji I. Convergence proof of coordinatewise minimization algorithm for convex programming problem with upper and lower bounded constraints. Journal of the Operations Research Society of Japan 29 (1986) 320-337 (in Japanese)
246. Operations Research Center, M.I.T., Notes on Operations Research 1959, The Technology Press, Cambridge, MA, 1959.
247. Osborne E.E. On pre-conditioning of matrices. Journal of the Association of Computing Machinery 7 (1960) 338-345
248. Pang J.-S. A new and efficient algorithm for a class of portfolio selection problems. Operations Research 28 (1980) 754-767
249. J.-S. Pang, On the convergence of dual ascent methods for large-scale linearly constrained optimization problems, technical report, School of Management, University of Texas at Dallas, Richardson, TX, 1984.
250. Pardalos P., and Kovoor N. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Mathematical Programming 46 (1990) 321-328
251. Pardalos P., Ye Y., and Han C.-G. Algorithms for the solution of quadratic knapsack problems. Linear Algebra and Its Applications 152 (1991) 69-91
252. Patriksson M. The Traffic Assignment Problem-Models and Methods. Topics in Transportation (1994), VSP BV, Utrecht, The Netherlands
253. Pigou A.C. The Economics of Welfare (1920), Macmillan & Co., London, UK
254. Pigou A.C. The Economics of Welfare. second ed. (1924), Macmillan & Co., London, UK
255. Pigou A.C. The Economics of Welfare. third ed. (1929), Macmillan & Co., London, UK
256. Pigou A.C. The Economics of Welfare. fourth ed. (1946), Macmillan & Co., London, UK
257. Polak E., and Ribière G. Note sur la convergence de méthodes de directions conjuguées. Revue Française Information Recherche Opérationnelle 16 (1969) 35-43
258. V.V. Popovich, Y.A. Ivakin, S.S. Shaida, Theory of search for moving objects, in: Oceans 2002 IEEE/MTS Conference Proceedings, Biloxi, MS, October 29-31, 2002, vol. 3, 2002, pp. 1319-1329.
259. Press W.H., Flannery B.P., Teukolsky S.A., and Vetterling W.T. Numerical Recipes in FORTRAN (1990), Cambridge University Press, Cambridge, NY
260. Robinson A.G., Jiang N., and Lemke C.S. On the continuous quadratic knapsack problem. Mathematical Programming 55 (1992) 99-108
261. Rockafellar R.T. Convex Analysis (1970), Princeton University Press, Princeton, NJ
262. Rockafellar R.T. Augmented Lagrangeans and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research 1 (1976) 97-116
263. Rockafellar R.T. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 14 (1976) 877-898
264. Rockafellar R.T. Monotropic programming: Descent algorithms and duality. In: Mangasarian O.L., Meyer R.R., and Robinson S.M. (Eds). Nonlinear Programming 4 (1981), Academic Press, New York, NY 327-366
265. Rockafellar R.T., and Wets R.J.-B. A note about projections in the implementation of stochastic quasigradient methods. Numerical Techniques for Stochastic Optimization. In: Ermol'ev Yu., and Wets R.J.-B. (Eds). Springer Series in Computational Mathematics no. 10 (1988), Springer-Verlag, Berlin 385-392
266. J. Rohn, Productivity of activities in the optimal allocation of one resource, working paper, Charles University, Prague, 1979.
267. Rohn J. Productivity of activities in the optimal allocation of one resource. Aplikace Matematiky (1982)
268. Roughgarden T. The price of anarchy is independent of network topology. Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (2002), ACM Press, New York, NY 428-437
269. Roughgarden T., and Tardos E. How bad is selfish routing?. Journal of the ACM 49 (2002) 236-259
270. Sanathanan L. On an allocation problem with multistage constraints. Operations Research 18 (1971) 1663-1747
271. Schneider M.H., and Zenios S.A. A comparative study of algorithms for matrix balancing. Operations Research 38 (1990) 439-455
272. Sharpe W.F. A simplified model for portfolio analysis. Management Science 9 (1963) 277-293
273. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (1985), Prentice-Hall, Englewood Cliffs, NJ
274. Shetty B., and Muthukrishnan R. A parallel projection for the multicommodity network model. Journal of the Operational Research Society 41 (1990) 837-842
275. Sinkhorn R. A relationship between arbitrary positive matrices and doubly stochastic matrices. Mathematical Statistics 35 (1964) 876-879
276. Smith A. An Inquiry into the Nature and Causes of the Wealth of Nations (1776), W. Strahan & T. Cadell, London, UK
277. Smith S., and Lasdon L. Solving large sparse nonlinear programs using GRG. ORSA Journal on Computing 4 (1992) 2-15
278. Spiess H. Biproportional matrix balancing with upper bounds. In: Gendreau M., and Marcotte P. (Eds). Transportation and Network Analysis: Current Trends. Applied Optimization vol. 63 (2002), Kluwer Academic Publishers, Dordrecht, The Netherlands 237-243
279. Srikantan K.S. A problem in optimum allocation. Operations Research 18 (1963) 265-273
280. Stefanov S.M. On the implementation of stochastic quasigradient methods to some facility location problems. Yugoslav Journal of Operations Research 10 (2000) 235-256
281. Stefanov S.M. Convex separable minimization subject to bounded variables. Computational Optimization and Applications 18 (2001) 27-48
282. Stefanov S.M. Separable Programming: Theory and Methods. Applied Optimization vol. 53 (2001), Kluwer Academic Publishers., Dordrecht, The Netherlands
283. Stefanov S.M. Convex separable minimization problems with a linear constraint and bounds on the variables. In: Ivanchev D., and Todorov M.D. (Eds). Applications of Mathematics in Engineering and Economics. Proceedings of the 27th Summer School held in Sozopol, 2001 (2002), Heron Press, Sofia 392-402
284. Stefanov S.M. Convex quadratic minimization subject to a linear constraint and box constraints. Applied Mathematics Research eXpress 2004 (2004) 17-42
285. Stefanov S.M. Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints. Journal of Applied Mathematics 5 (2004) 409-431
286. Stone B.K. A linear programming formulation of the general portfolio selection problem. Journal of Financial and Quantitative Analysis 8 (1973) 621-636
287. Stone L.D. Theory of Optimal Search (1975), Academic Press, New York, NY
288. Takahashi I. Variable separation principle for mathematical programming. Journal of the Operations Research Society of Japan 6 (1963/1964) 82-105
289. Takahashi I. A method for solving network transportation problems with quadratic cost functions. Bulletin of the Institute for Research in Productivity: Waseda University 1 (1970) 25-31
290. Tang C.S. A max-min allocation problem: Its solutions and applications. Operations Research 36 (1988) 359-367
291. Theil H., and van de Panne C. Quadratic programming as an extension of conventional quadratic maximization. Management Science 7 (1960) 1-20
292. J.A. Tomlin, Mathematical programming models for traffic network problems, Ph.D. thesis, Department of Mathematics, University of Adelaide, Adelaide, Australia, 1967.
293. Traub J.F. Iterative Methods for the Solution of Equations (1964), Prentice-Hall, Englewood Cliffs, NJ
294. Tseng P. Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach. SIAM Journal on Control and Optimization 28 (1990) 214-242
295. Tseng P. Descent methods for convex essentially smooth minimization. Journal of Optimization Theory and Applications 71 (1991) 425-463
296. Tseng P., and Bertsekas D.P. Relaxation methods for problems with strictly convex separable costs and linear constraints. Mathematical Programming 38 (1987) 303-321
297. Tseng P., and Bertsekas D.P. Relaxation methods for monotropic programs. Mathematical Programming 46 (1990) 127-151
298. J.A. Ventura, Algorithms for quadratic transportation networks, in: Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, FL, 1989, pp. 1131-1135.
299. Ventura J.A. Computational development of a Lagrangian dual approach for quadratic networks. Networks 21 (1991) 469-485
300. J.A. Ventura, D.W. Hearn, Computational development of a Lagrangian dual approach for quadratic networks, Working paper 8710902, Department of Industrial Engineering, University of Missouri at Columbia, Columbia, MU, 1988.
301. Ventura J.A., and Klein C.M. A note on multi-item inventory systems with limited capacity. Operations Research Letters 7 (1988) 71-75
302. P.V.V. Vidal, Operations research in production planning, Ph.D. thesis, IMSOR, The Technical University of Denmark, 1970.
303. Vidal P.V.V. A graphical method to solve a family of allocation problems. European Journal of Operational Research 17 (1984) 31-34
304. Vidal P.V.V. Solving a family of simple allocation problems. Investigaci'on Operacional. Revista 7 (1986) 33-47
305. Vidal P.V.V. A simple method to solve some simple allocation problems. IIE Transactions 19 (1987) 234-237
306. von Neumann J. Zur Theorie der Gesellschaftsspiele. Mathematische Annalen 100 (1928) 295-320
307. J.H. von Thünen, Der isolierte Staat in Beziehung auf Landwirtschaft und Nationalökonomie, Hamburg, 1826. Translated as Von Thünen's Isolated State by C.M. Wartenberg, Pergamon Press, London, UK, 1966.
308. Wagner H.M., and Whitin T.M. Dynamic version of the economic lot-size model. Management Science 5 (1958) 89-96
309. Walters A.A. Track costs and motor taxation. Journal of Industrial Economics (1954)
310. Walters A.A. The theory and measurement of private and social cost of highway congestion. Econometrica 29 (1961) 676-699
311. Wardrop J.G. Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers, Part II (1952) 325-378
312. Washburn A.R. Note on constrained maximization of a sum. Operations Research 29 (1981) 411-414
313. Weigel H.S., and Cremeans J.E. The multicommodity network flow model revised to include vehicle per time period and node constraints. Naval Research Logistics Quarterly 19 (1972) 77-89
314. C. Wilkinson, S.K. Gupta, Allocating promotional effort to competing activities: A dynamic programming approach, in: IFORS Conference, Venice, Italy, 1969, pp. 419-432.
315. Wilson R.H. A scientific routine for stock control. Harvard Business Review 13 (1934) 116-128
316. Wolfe P. Algorithm for a least-distance programming problem. Mathematical Programming Study 1 (1974) 190-205
317. Wolfe P. Finding the nearest point in a polytope. Mathematical Programming 11 (1976) 128-149
318. Wu C.-H., and Ventura J.A. Computational development of a dual block-coordinate algorithm for constrained matrix problems. Mathematical Modeling and Scientific Computing (1995)
319. Yao D., and Shanthikumar J. The optimal input rates to a system of manufacturing cells. INFOR 25 (1987) 57-65
320. Zadeh N. A note on the cyclic coordinate ascent method. Management Science 16 (1969/1970) 642-644
321. Zahl S. An allocation problem with applications to operations research and statistics. Operations Research (1963)
322. Zangwill W.I. Nonlinear Programming: A Unified Approach (1969), Prentice-Hall, Englewood Cliffs, NJ
323. Zenios S.A., and Censor Y. Massively parallel row-action algorithms for some nonlinear transportation problems. SIAM Journal on Optimization 1 (1991) 373-400
324. Zenios S.A., and Mulvey J.M. Relaxation techniques for strictly convex network problems. Annals of Operations Research 5 (1985/1986) 517-538
325. Zenios S.A., and Mulvey J.M. A distributed algorithm for convex network optimization problems. Parallel Computing 6 (1988) 45-56
326. Ziegler H. Solving certain singly constrained convex optimization problems in production planning. Operations Research Letters 1 (1982) 246-252
327. P.H. Zipkin, Error bounds for aggregated convex transportation problems, working paper, Graduate School of Business, Columbia University, New York, NY, 1980.
328. Zipkin P.H. Simple ranking methods for allocation of one resource. Management Science 26 (1980) 34-43