This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
VIII.1 Operations Research Verfahren der Optimierung
Hu, T. C. and Robinson, S. M. (Eds.): Mathematical Programming, Academic Press, New York, 1973
Foulds, L. R.: Optimization Techniques, Springer, New York, 1981
Hillier, F. S. and Lieberman, G. J.: Introduction to Operations Research, Holden-Day, San Francisco, 1967
Gaede, K.-W. und Heinhold, J.: Grundzüge des Operations Research, Teil 1, Hanser Verlag, München, 1976
Neumann, K.: Operations Research Verfahren, Band 1 (1975), Band 2 (1977), Band 3 (1975), Karl Hanser Verlag, München
Müller-Merbach, H.: Operations Research, Verlag Franz Vahlen GmbH, Berlin und Frankfurt, 1969
Collatz, L. und Wetterling, W.: Optimierungsaufgaben, Springer, Berlin, 1966
Riggs, J. L. and Inoue, M. S.: Introduction to Operations Research and Management Science, McGraw-Hill, New York, 1975
Saaty, T. L.: Mathematical Methods of Operations Research, McGraw-Hill, New York, 1959
Moore, P. G. and Hodges, S. D. (Ed.): Programming for Optimal Decisions, Penguin Modern Management Readings, Middlesex, 1970
Williams, H. P.: Model Building in Mathematical Programming, John Wiley, New York, Second Edition, 1984
Churchman, C. W., Ackoff, R. L., and Arnoff, E. L.: Operations Res., Eine Einf. in die Unternehmensforschung, Oldenbourg, Wien, 1961
Ackoff, R. L.: Progress in Operations Research, Vol. 1, John Wiley, New York, 1961
Sasieni, M. W., Yaspan, A. and Friedman, L.: Operations Research, Methods and Problems, Wiley, New York, 1959
Nieswandt, A.: Operations Research, 2. Auflage, NWB Verlag, Herne und Berlin, 1984
Bachem, A., Korte, B., and Grötschel, M. (Editors): Mathematical Programming—The State of the Art. Proc. 11th Int. Symp. on Math. Progr., Held 1982 at the Univ. of Bonn, Springer, Berlin, 1983
Aronson, J. E. and Thompson, G. L.: Survey on Forward Methods in Math. Programming, Large Scale Systems, Vol. 7, No. 1, 1984
Gill, P. E., Murray, W., and Wright, M. H.: Practical Optimization, Academic Press, London, 1981
Landry, M., Malouin, J.-L., and Oral, M.: Model Validation in Operations Research, Eur. J. Oper. Res., Vol. 14, No. 3, 1983
Müller-Merbach, H.: Optimale Reihenfolgen, Springer, 1970
Gal, T.: Betriebliche Entscheidungsprobleme, Sensitivitätsanalyse und parametrische Programmierung, Springer, Berlin, 1973
Dinkelbach, W.: Sensitivitätsanalysen und parametrische Programmierung, Springer, Berlin, 1969
Kuenzi, H. P.: Numerische Methoden der mathematischen Optimierung mit ALGOL und FORTRAN Programmen, Teubner, 1966
Blum, E. und Oettli, W.: Mathematische Optimierung—Grundlagen und Verfahren, Springer, Berlin, 1975
Woolsey, R. E. D. and Swanson, H. S.: Oper. Res. for Immediate Application-A Quick and Dirty Manual, Harper and Row, New York, 1975
Teichroew, D.: An Introduction to Management Science Deterministic Models, Wiley, New York, 1964
Hertz, D. B. and Eddison, R. T. (Eds.): Progress in Operations Research, Vol. II, Wiley, New York, 1964
Aronofsky, J. S. (Ed.): Progress in Operations Research, Vol. III, OR and the Computer, Wiley, New York, 1969
Graves, R. L. and Wolfe, P. (Eds.): Recent Advances in Mathematical Programming, McGraw-Hill, New York, 1963
Ackoff, R. L. and Sasieni, M. W.: Operations Research, Grundzuege der Operationsforschung, Akademie-Verlag, Berlin, 1970
Beale, E. M. L.: Mathematical Programming in Practice, John Wiley, New York, 1968
Beale, E. M. L. (Ed.): Applications of Mathematical Programming Techniques, Engl. Univ. Press, London, 1970
Charnes, A. and Cooper, W. W.: Management Models and Industrial Applications of Linear Progr., John Wiley, New York, 1961
Balinski, M. L. and Lemarechal, C.: Mathematical Programming in Use, North Holland, Amsterdam, 1978
Moore, P. G. and Hodges, S. D. (Editor): Programming for Optimal Decisions, Penguin, 1970
Gorstko, A.: Mathematical Models and Optimal Planning, Nauka, Novosibirsk, 1966
Ackoff, R. L. und Rivett, P.: Industrielle Unternehmensforschung, München, 1966
Arnoff, E. L. and Sengupta, S. S.: Mathematical Programming, in VIII.1. 1–13, 1961
Balakrishnan, A. V. and Neustadt, L. W. (Eds.): Computing Methods in Optimization Problems, Proceedings of a Conf. Held at the Univ. of California, Los Angeles, 1964, Academic Press, New York, 1964
Balakrishnan, A. V. and Zadeh, I. A. (Eds.): Computing Methods in Optimization Problems, Papers Presented at the 2nd Intern. Conf. on Comp. Methods, San Remo, Italy, 1968, Springer, Berlin, 1968
Müller-Merbach, H.: Operations Research Fibel für Manager, Moderne Industrie, München, 1971
Vajda, S.: Mathematical Programming, Addison Wesley, London, 1961
Vajda, S.: Planning by Mathematics, Pitman, London, 1969
Vajda, S.: Readings in Math. Programming, Wiley, New York, 1962
House, W. C. (Ed.): Operations Research, an Introduction to Modern Applications, Auerbach, Princeton, N. J., 1972
Stahlknecht, P.: Operations Research, Vieweg, Braunschweig, 1972
Stahlknecht, P.: Operation Research, ein Leitfaden für den Praktiker, Elektronische Datenverarbeitung, Beihefte
Leitmann, G.: Optimiz. Techniques, Academic Press, New York, 1962
Wagner, H. M.: Principles of Operations Research, Prentice-Hall, Englewood Cliffs, N. J., 1969
Whitehouse, G. E. and Wechsler, B. L.: Applied Operations Research-A Survey, Wiley, New York, 1976
Pun, L.: Abriss der Optimierungspraxis, Oldenbourg, München, 1974
Lasdon, L. S.: Optimization Theory for Large Systems, Macmillan, New York, 1972
Koch, G. und Mund, K.: Math. Planungsverfahren, Hanser, München, 1981
Dueck, W. und Bliefernich, M. (Eds.): Operationsforschung, Mathematische Grundlagen, Methoden und Modelle, Band 1–3, VEB Deutscher Verlag der Wissenschaften, Berlin, 1971–1972
Fandel, G., Fischer, D., Pfahl, H.-C. und Schuster, K.-P. (Eds.): Operations Research Proceedings, DGOR Annual, Meeting, Essen 1980, Physica, Würzburg, 1981
Schwarze, J., Dobschuetz, L. und Fleischmann, B. (Eds.): Operations Research Proc., DGOR Annual Meeting, 1979, Physica, Würzburg, 1980
Ohse, D., Esprester, A., Kuepper, H.-U., Staehly, P. und Steckhan, H. (Eds.): Oper. Res. Proceedings, DGOR Annual Meeting, 1984, Springer, Berlin, 1985
Brockhoff, K., Dinkelbach, W. und Kall, P. (Eds.): Operations Research Proceedings, DGOR Annual Meeting, 1977, Physica, Würzburg, 1978
Jacob, H., Pressmar, D. B., Todt, H. und Zimmermann, H.-J. (Eds.): Proceedings in Operations Research 2 DGOR Annual Meeting 1972, Physica, Würzburg, 1973
Kaufmann, A. et Faure, R.: Invitation a la recherche operationelle, Dunod, Paris, 1968
Kaufmann, A.: Methodes et modeles de la recherche operationelle, Dunod, Paris, 1962
Darby-Dowman, K., Lucas, C., Mitra, G., and Yadegar, J.: Linear, Integer, Separable and Fuzzy Programming Problems—A Unified Approach Towards Reformulation, Operations Research, Vol. 39, No. 2, 1988, 161–171
Kilian, R. und Matthies, W.: Mathematische Methoden in Organisation und Planung, VEB Verlag Technik, Berlin, 1965
Barritt, M. M. and Wishart, D. (Eds.): Proceedings in Computational Statistics (COMPSTAT 80), Physica Verlag, Wien, 1980
Lawrence, J. (Ed.): Proceedings of the 5th International Conference on Operations Research, Tavistock, London, 1969
Alarcon, E. and Brebbia, C. (Eds.): Applied Numerical Modeling, Pentech Press, London, 1979
Jacobs, D. A. H. (Ed.): The State-of-the-Art in Numerical Analysis, Academic Press, London, 1977
Brearley, A. L., Mitra, G. and Williams, H. P.: Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm, Math. Progr., Vol. 8, 1975, 54–83
Karwan, M. H., Lodi, V., Telgen, J. and Zionts, S.: Redundancy in Math. Progr.—A State-ofthe-Art Survey, Springer, New York, 1983
Guignard, M.: Conditions d’optimalite et dualite en programmation mathematique, Universite de Lille, Laboratoire de Calcul, These de Doctorat de Specialite, 1967
Judice, J. J. and Mitra, G.: Reformulation of Mathematical Programming Problems as Linear Complementarity Problems and Investigation of their Solution Methods, J. Optim. Theory and Appl., Vol. 57, No. 1, 1988, 123–149
Feichtinger, G.: Anwendung des Maximumprinzips im Operations Research, OR Spektrum, Vol. 4, 1982, 171–190 und 195–212
Sethi, S. P.: A Survey of Management Science Applications of the Deterministic Maximum Principle, TIMS Studies in Mgmt. Sciences, No. 9, North-Holland, Amsterdam, 1978, 33–67
Kamien, M. I. and Schwartz, N. L.: Dynamic Optimization, North Holland, New York, 1981
Pontrjagin, L. S., Boltjanskij, V. G. and Gamkrelidze, R. V.: Mathematische Theorie optimaler Prozesse, R. Oldenbourg, München, 1964
Canon, M. D.: Monoextremal Representations of a Class of Minimax Problems, Mgmt. Sci., Vol. 15, No. 5, 1969, 228–238
Moore, R. E. and Ratschek, H.: Inclusion Functions and Global Optimization II, Math. Progr., Vol. 41, No. 3, 1988, 341–356
Dixon, L. C. W. and Szego, G. P. (Editors): Toward Global Optimization, North Holland, Amsterdam, 1978
Orban, P.: Über ein Verfahren zur globalen Optimierung, Wiss. Zeitschr. Techn. Hochschule Magdeburg, Vol. 18, No. 4, 1974, 369–373
Neider, J. A. and Mead, R.: A Simplex Method for Function Minimization, Comput. J., Vol. 7, 1965, 308–313
Kaplan, S.: Applications of Programs with Maximin Objective Function to Problems of Optimal Resource Allocation, Oper. Res., Vol. 22, No. 4, 1974
Gupta, R. and Arora, S. R.: Programming Problems with Maximin Objective Function, Zeitschr. für Oper. Res., Vol. 22, 1978, 69–72
Stern, M.: Mathematics for Management, Prentice Hall, Englewood Cliffs, New Jersey, 1963
Cheney, L. K., Ullman, R. J. and Kawarantani, T. T.: The Significance of Mathematical Programming in the Business World, RAND Symposium on Math. Programming 1959, RAND Report R-351, 1960
Fletcher, R. (Ed.): Optimization, Academic Press, London, 1969
Mador, J. J. and Elmaghraby, S. E.: Handbook of Operations Research, Van Nostrand-Reinhold, New York, 1978
Geoffrion, A. M. (Ed.): Perspectives on Optimization, Addison Wesley, Reading, Mass., 1972
Himmelblau, D. M. (Ed.): Decomposition of Large-Scale Problems, Proceedings of a Conference, Cambridge U.K., July 17–26, 1972, North-Holland, Amsterdam, 1973
Zimmermann, H.-J.: Einf. in die Grundlagen des Oper. Res.—Eine nicht-mathematische Einf., Morderne Industrie, München, 1972
Greenberg, H., Murphy, F. and Shaw, S. (Editors): Advanced Techniques in the Practice of Oper. Res., North-Holland, Amsterdam, 1982
Purdom, P. W. Jr. and Brown, C. A.: The Analysis of Algorithms, Holt, Rinehart and Winston, New York, 1985
Schittkowski, K. (Ed.): Computational Mathematical Programming, Springer, Heidelberg, NATO ASI Series F, Computer and Systems Sciences Vol. 15, 1984
Neustadt, L. W.: Optimization, Princeton Univ. Press, Princeton, N. J., 1976
Ioffe, A. D. und Tichomirov, V. M.: Theorie der Extremalaufgaben, Deutscher Verlag der Wissenschaften, Berlin, 1979
loffe, A. D. und Tichomirov, V. M.: Theory of Extremal Problems, North Holland, Amsterdam, 1979
Dantzig, G. B. and Veinot, A. F. (Eds.): Math. of the Decision Sciences, Part 1 and 2, American Math. Soc., Providence, R. I., 1968
Berge, C. and Ghouila-Houri, A.: Programming, Games and Transportation Networks, Methuen and Co., London, 1965
Eppen, G. D., Gould, F. S. and Schmidt, C. P.: Introductory Management Science, Prentice-Hall, Englewood Cliffs, N. J., 1987
Sholomov, L. A. and Yudin, D. B.: The Complexity of Multistep Generalized Mathematical Programming Schemas, Soy. J. Comput. Syst. Sci., Vol. 26, No. 4, 1988, 127–136
Powell, M. J. D. (Ed.): Mathematical Models and their Solution-Contributions to the Martin Beale Memorial Symposium, Math. Progr., Vol. 42, No. 1, Special Issue, April 1988
Wilde, D. J.: Optimum Seeking Methods, Prentice-Hall, Englewood Cliffs, N. J., 1965
Beightler, C. S., Phillips, D. T. and Wilde, D. J.: Foundations of Optimization, 2nd Edition, Prentice-Hall, Englewood Cliffs, New Jersey, 1979
Kronsjo, L.: Computational Complexity of Sequential and Parallel Algorithms, Wiley, Great Britain, 1985
Littger, K.: Standard-Register des Operations Research, Verlag Moderne Industrie, München, 1971
Bazaraa, M. S. and Shetty, C. M.: Foundations of Optimization, Springer, Berlin, 1976
Zoutendijk, G.: Math. Progr. Methods, North Holland, Amsterd., 1976
Rivett, B. H. P.: Concepts of Oper. Res., Watts, London, 1968
Shapiro, J. F.: Mathematical Programming-Structures and Algorithms, Wiley, New York, 1979
Dixon, L. C. W. (Ed.): Optimization in Action, Academic Press, London, 1976
Mc Milian, C.: Mathematical Programming, Wiley, New York, 1975
Vazsonyi, A.: Scientific Programming in Business and Industry, John Wiley, New York, 1958
Duerr, W. und Kleibohm, K.: Operations Research. Lineare Modelle und ihre Anwendung, Hanser Verlag, München, 1983
Cesari. L.: Optimization-Theory and Appl., Springer, Berlin, 1983
Kaufmann, A. and Gupta, M. M.: Fuzzy Mathematical Models in Engineering and Management Science, North-Holland, Amsterdam, 1988
Rand, G. K. (Ed.): Operational Research ‘87, Proceedings of the 11th IFORS International Conference, Buenos Aires, Argentinia, 10–14 August 1987, North-Holland, Amsterdam, 1988
Nemhauser, G. L., Rinnooy Kan, A. H. G., and Todd, M. J. (Eds.): Optimization, Handbooks in Operations Research and Management Science, Vol. 1, North-Holland, Amsterdam, 1989
Sivazlian, B. D. and Stanfel, L. E.: Optimization Techniques in Operations Research, Prentice-Hall, Englewood Cliffs, N. J., 1975
Taha, H. A.: Oper. Res.-An Introduction, Macmillan, New York, 1983
Luenberger, D. G.: Linear and Nonlinear Programming, Addison-Wesley, New York, 1984
Prekopa, A. (Ed.): Survey of Math. Progr., North Holland, Amsterdam, 1979
Philips, T. D., Ravindran, A., and Solberg, J. J.: Operations Research-Principles and Practice, Wiley, New York, 1976
Geoffrion, A. M.: Elements of Large Scale Mathematical Programming, Mgmt. Sci., Vol. 16, 1970, 652–691
Thoft-Christensen, P. (Ed.): System Modeling and Optimization, Springer, New York, 1984
Beale, E. M. L.: Introduction to Optimization, Wiley, New York, 1988
Megiddo, N. (Ed.): Progress in Math. Progr., Springer, New York, 1988
Kaufmann, A. and Faure, R.: Introduction to Operations Research, Academic Press, New York, 1968
Carr, C. R. and Howe, C. W.: Introduction to Quantitative Decision Procedures in Mgmt. and Economics, McGraw-Hill, New York, 1964
Gottfried, B. S. and Weisman, J.: Introduction to Optimization Theory, Prentice-Hall, Englewood Cliffs, N. J., 1973
Kreweras, G. and Morlat, G. (Eds.): Proceedings of the Third International Conference on Operations Research, Dunod, Paris, und English Universities Press, London, 1963
Pierre, D. A.: Optimization Theory with Appl., Wiley, New York, 1969
Gal, T.: Postoptimal Analysis, Parametric Programming and Related Topics, McGraw-Hill, New York, 1978
Bartels, R. H., Golub, G. H., and Saunders, M. G.: Numerical Techniques in Mathematical Programming, in VIII.1. 5–160, 1970, 123–176
Kuhn, H. W. (Ed.): Proceedings of the Princeton Symposium on Math. Progr., Princeton Univ. Press, Princeton, N. J., 1970
Churchman, C. W. and Verhulst, M. (Eds.): Management Science—Models and Techniques, Pergamon Press, London, 1960
Churchman, C. W.: Prediction and Optimal Decision, Prentice-Hall, Englewood Cliffs, New Jersey, 1961
Hertz, D. B.: A Comprehensive Bibliography on Operations Research 1957–1958, Wiley, New York, 1963
Hertz, D. B. and Melese, J. (Eds.): Proceedings of the Fourth International Conf. on Operations Research, Wiley, New York, 1966
Gillet, B. E.: Introduction to Operations Research—A Computer-Oriented Algorithm Approach, McGraw-Hill, New York, 1976
Korte, B. (Ed.): Modern Applied Mathematics—Optimization and Operations Research, North Holland, 1982
Gustafson, S.-A. and Kortanek, K. O.: Semi-Infinite Programming and Applications, in VIII.1. 1–16, 1983, 132–157
Krabs, W.: Optimierung und Approximation, Teubner, Stuttgart, 1975
Perold, A. F.: Extreme Points and Basic Feasible Solutions in Continuous Time Lin. Progr., SIAM J. Contr. Opt., Vol. 19, 1981, 52
Späth, H. (Ed.): Fallstudien Operations Research, Band 1 und 2, Oldenbourg Verlag, Müchen, 1978
Minoux, M.: Programmation Mathematique—Theorie et algorithmes, Dunod, Paris, 1983
Rao, S. S.: Optimization Theory and Applications, Wiley Eastern Ltd., New Delhi, 1979
Gessner, P., Henn, R., Steinecke, V. und Todt, H. (Eds.): Proceedings in Operations Research 3, Papers of the DGOR Annual Meeting 1973, Physica Würzburg, 1974
Henke, M., Jaeger, A., Wartmann, R., and Zimmermann, H.-J. (Eds.): Proceedings in Operations Research 1, DGOR Annual Meeting 1971, Physica Würzburg, 1972
Wallace, S. W. (Ed.): Algorithms and Model Formulations in Mathematical Programming, Proceedings of NATO Advanced Research Workshop in Bergen (1987), Springer, Berlin, 1989
Waters, C. D.: A Practical Introduction to Management Science, Addison-Wesley, Wokingham, 1989
Reinfeld, N. V. and Vogel, W.: Mathematical Programming, Prentice-Hall, Englewood Cliffs, N. J., 1958
Dantzig, G. B.: Linear Programming and Extensions, Princeton Univ. Press, 1963
Hadley, G.: Linear Programming, Addison-Wesley Publishing Company, Reading, Mass., 1962
Sakarovitch, M.: Linear Programming, Springer, New York, 1984
Zionts, S.: Linear and Integer Programming, Prentice-Hall, Englewood Cliffs, N. J., 1974
Dantzig, G. B.: Lineare Progr. und Erweiterungen, Springer, Berlin, 1966
Joksch, H. C.: Lineares Programmieren, Mohr, Tuebingen, 1962
Runzheimer, B.: Operations Research. Band 1: Lineare Planungsrechnung und Netzplantechnik, Gabler, Wiesbaden, 1978
Ignizio, J. P.: Linear Programming in Single and Multiple Objective Systems, Prentice-Hall, New Jersey, 1982
IBM: An Introduction to Linear Programming, Form-No. GE20–8171, White Plains, N. Y., 1964
Orchard-Hays, W.: Advanced Linear Programming Computing Techniques, McGraw-Hill, New York, 1968
Murtagh, B. A.: Advanced Linear Programming: Computation and Practice, McGraw-Hill, New York, 1981
Garcia, C. B. and Gould, F. J.: Application of Homotopy to Solving Linear Programs, Math. Progr., Vol. 27, No. 3, 1983
Ho, J. K. and Loute, E.: Computational Experience with Advanced Implementation of Decomposition Algorithms for Linear Programming, Math. Progr., Vol. 27, No. 3, 1983
Klee, V. and Minty, G. L.: How Good is the Simplex Agorithm?, in O. Shisha (Ed.), Inequalities III, Academic Press, New York, 1972, 159–179
Khachiyan, L. G.: A Polynomial Algorithm in Linear Programming, Doklady Akademiia Nauk SSSR 244: S (1979)
Khachiyan, L. G.: Translated in Soviet Mathematics Dolady, 20: 1, 1979
Grötschel, M., Lovasz, L., and Schrijver, A.: The Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica, Vol. 1, No. 2, 1981
Karmarkar, N.: A New Polynomial Time Algorithm for Linear Programming, ATandT Bell Lab., Murray Hill, N. J., undated, about 1984
Tomlin, J. A.: An Experimental Approach to Karmarkar’s Projective Method for Linear Programming. Mathematical Programming Study 31, North-Holland, Amsterdam, 1987, 175191
Ignizio, J. P.: Linear Programming in Single and Multiple Objective Systems, Prentice-Hall, Englewood Cliffs, N. J., 1982
Bartels, R. H.: A Numerical Investigation of the Simplex Method, Thesis, Stanford Univ., 1968
Megiddo, N.: On the Complexity of Linear Programming, IBM Research Division, Report RJ 4985 (52162) 1/9/86, IBM Almaden Res. Center, San Jose, California, 1986
Ferris, M. C. and Philpott, A. B.: On the Performance of Karmarkar’s Algorithm, J. Oper. Res. Soc., Vol. 39, No. 3, 1988, 257–270
Karmarkar, N.: A New Polynomial Type Algorithm for Linear Programming, Combinatorica, Vol. 4, 1984, 373–395
Harris, P. M. J.: Pivot Selection Methods of the DEVEX LP Code, Math. Progr., Vol. 5, 1973, 1–28
Dantzig, G. B. and Orchard-Hays, W.: The Product Form of the Inverse In the Simplex Method, Mathematical Tables and Aids to Computation, Vol. 8, 1954, 64–67
Ryan, D. M. and Osborne, M. R.: Solution of Highly Degenerate Linear Programs, Math. Progr., Vol. 41, No. 3, 1988, 385–392
Magnanti, T. L. and Orlin, J. B.: Parametric Linear Programming and Anti-Cycling Pivoting Rules, Math. Progr., Vol. 41, No. 3, 1988, 317–325
Robers, P. D.: Interval Linear Programming, Ph.D. Thesis, Northwestern Univ., Evanston, III., 1968
Driebeek, N. J.: Applied Linear Programming, Addison-Wesley Publishing Company, Reading, Mass., 1969
Kuhn, H. W. and Tucker, A. W. (Eds.): Linear Inequalities and Related Systems, Princeton Univ. Press, Princeton, N. J., 1956
Tomlin, J. A.: An Experimental Approach to Karmarkar’s Projective Algorithm for Linear Programming, Mathematical Programming Study, Vol. 31, 1987, 175–191
Todd, M. J. and Burrell, B. P.: An Extension of Karmarkar’s Algorithm for Linear Programming Using Dual Variables, Algorithmica, Vol. 1, 1986, 409–424
Gill, P. E., Murray, W., Saunders, M. A., Tomlin, J. A., and Wright, M. H.: On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar’s Projective Method, Math. Progr., Vol. 36, 1986, 183–209
Adams, W. J., Gerwitz, A., and Quintas, L. V.: Elements of Linear Programming, Van Nostrand Reinhold, New York, 1969
Agmon, S.: The Relaxation Method for Linear Inequalities, Canad. Journal of Mathematics, Vol. 6, 1954, 382–392
Antosiewicz, H. A. (Ed.): Proceedings of the Second Symposium in Linear Programming, Vol. 2, National Bureau of Standards, Washington, D. C., 1955
Arrow, K. J., Hurwicz, L., and Uzawa, H.: Studies in Linear and Non-Linear Programming, Stanford Univ., Stanford Univ. Press. Cal., 1972
Beale, E. M. L.: An Alternative Method for Linear Programming, Proc. of the Cambridge Phil. Soc., Vol. 50, No. 4, 1954, 513–523
Beale, E. M. L.: Cycling in the Dual Simplex Algorithm, Naval Research Logistics Quarterly, Vol. 2, 1955, 269–275
Beckmann, M. J.: Lineare Planungsrechnung, Fachverlag für Wirtschaftstheorie und ökonometrie, Ludwigshafen/Rhein, 1959
Belakreko: Lehrbuch der Linearen Optimierung, VEB Deutscher Verlag der Wissenschaften, Berlin, 1964
Spivey, W. A.: Linear Programming, Macmillam, New York, 1963
Wolfe, P.: A Technique for Resolving Degeneracy in Linear Programming, J. SIAM, Vol. 11, 1963, 205–211
Wolfe, P.: The Composite Simplex Algorithm, SIAM Review, Vol. 7, 1965, 42–54
Orden, A. and Goldstein, L. (Eds.): Symposium on Linear Inequalities and Programming, Washington, D. C., 1952
Solnik, B. H.: La programmation lineaire, Dunod, Paris, 1969
Sordet, J.: La programmation lineaire appliquee a l’entreprise, 1970
Soom, E.: Einfuehrung in die Lineare Programmierung, Verlag Techn. Rundschau, bern, 1970
Simmonard, M.: Linear Programming, Prentice-Hall, Englewood Cliffs, N. J., 1966
Tomlin, J. A.: On Scaling Linear Programming Problems, Mathematical Programming Study, Vol. 4, 1975, 146–166
Dantzig, G. B. and Wolfe, P.: A Decomposition Principle for Linear Programs, Operations Research, Vol. 8, No. 1, 1960, 101–111
Garvin, W. W.: Introduction to Linear Programming, McGraw-Hill, New York, 1960
Todd, M. J.: Exploiting Special Structure in Karmarkars Linear Programming Algorithm, Math. Progr., Vol. 41, 1988, 97–113
Todd, M. J.: An Implementation of the Simplex Method for Linear Programming Problems with Variable Upper Bounds, Math. Progr., Vol. 23, 1982, 34–49
Todd, M. J.: Improved Bounds and Containing Ellipsoids in Karmarkar’s Linear Programming Algorithm, Operations Research, 1989
Rinaldi, G.: A Projective Method for Linear Programming with Box-Type Constraints, Algorithmica, Vol. 1, 1986, 517–527
Steger, A.: An Extension of Karmarkar’s Algorithm for Bounded Linear Programming Problems, M. S. Thesis, State Univ. of New York at Stonybrook, Stonybrook, N.Y., 1985
Gay, D. M.: A Variant of Karmarkar’s Linear Programming Algorithm for Problems in Standard Form, Math. Progr., Vol. 37, No. 1, 1987, 81–90
Dantzig, G. B. and Van Slyke, R. M.: Generalized Upper Bounding Techinque, J. Comp. Syst. Sci., Vol. 1, 1967, 213–226
Bland, R. G., Goldfrab, D., and Todd, M. J.: The Ellipsoid Method—A Survey, Operations Research, Vol. 29, 1981, 1039–1091
Mehrotra, S.: Variants of Karmarkar’s Algorithm—Theoretical Complexity and Practical Implementation, Ph.D. Thesis, Ind. Eng. and Oper. Res. Dept., Columbia Univ., 1987
Goldfarb, D. and Mehrotra, S.: Relaxed Variants of Karmarkar’s Algorithm for Linear Programs with Unknown Optimal Objective Value, Math. Progr., Vol. 40, 1988, 183–195
Padberg, M.: A Different Convergence Proof of the Projective Method for Lin. Progr., Oper. Res. Letter, Vol. 4, No. 6, 1986, 253–257
Borgwardt, K. H.: Der durchschnittliche Rechenaufwand beim Simplexverfahren, in VIII.1. 1–57, 1985
Judin, D. B. und Golstein, E. G.: Lineare Optimierung I, Akademie Verlag, Berlin, 1968
Judin, D. B. und Golstein, E. G.: Lineare Optimierung II, Akademie Verlag, Berlin, 1970
Richter, K. J.: Methoden der Linearen Optimierung, VEB Fachbuchverlag, Leipzig, 1966
Chvatal, V.: Linear Programming, W. M. Freeman and Co., 1982
Dantzig, G. B.: Large Scale Linear Programs—A Survey, 7th Int. Symp. on Math. Progr., The Hague, Netherlands, 1970
Salkin, H. M. and Saha, J. (Eds.): Studied in Linear Programming, North Holland/American Elsevier, Amsterdam, 1975
Sloan, S. W.: Steepest Edge Active Set Algorithm for Solving Sparse Linear Programming Problems, Int. J. Numer. Methods Eng., Vol. 26, No. 12, 1988, 2671–2685
Haugland, D. and Wallace, S. W.: Solving Many Linear Programs that Differ Only in the Righthand Side, Eur. J. Oper. Res., Vol. 37, No. 3, 1988, 318–324
Myers, D. C. and Shih, W.: Constraint Selection Technique for a Class of Lin. Programs, Oper. Res. Letters, Vol. 7, No. 4, 1988, 191–195
Dantzig, G. B., Orden, A., and Wolfe, P.: The Generalized Simplex Method for Minimizing a Linear Form Under Linear Inequality Restraints, Pacific J. Math., Vol. 5, 1955, 183–195
Dantzig, G. B.: Time-Staged Linear Programs, Stanford Univ., Techn. Report SOL-80–28, 1980
Dantzig, G. B.: On the Status of Multistage Linear Programming Problems, Mgmt. Sci., Vol. 6, 1959, 53–72
Schebesch, K. und Stoeppler, S.: Dynamische lineare Programme und lineare Kontrollprobleme—Problemstellungen, Lösungen, Anwendungen, Arbeitsbericht 15 der Forschungsgruppe Planung und Prognose, Universität Bremen, 1984
Stoeppler, S.: Dynamische Lineare Programme und Lineare Kontroll-Probleme, in VIII.1. 1–57, 1985, 524–531
Borgwardt, K. H.: The Average Number of Pivot Steps Required by the Simplex-Method is Polynomial, Zeitschr. für Oper. Res.,Vol. 26, 1982, 157–177
Borgwardt, K. H.: Zum Rechenaufwand von Simplexverfahren, Operations Research Verfahren, Vol. 31, 1978, 83–97
Haimovich, M.: The Simplex Algorithm is Very Good—On the Expected Number of Pivot Steps and Related Properties of Random Linear Progr., 415 Uris Hall, Columbia Univ., New York, April 1983
Liebling, T.: On the Number of Iterations of the Simplex-Algorithm, ETH Zuerich, Institut für Operations Research, 1972
Smale, S.: On the Average Speed of the Simplex Method, in VIII.1. 1–16, 1983, 530–539
Goldfarb, D.: Worst Case Complexity of the Shadow Vertex Simplex Algorithm, Columbia Univ. School of Eng. and Appl. Science, 1983
Goldfarb, G., and Sit, W. J.: Worst Case Behavior of the Steepest Edge Simplex Method, Discrete Appl. Math., Vol. 1, 1979, 277–285
Markowitz, H. M.: The Elimination Form of the Inverse and its Applications to Lin. Progr., Mgmt. Sci., Vol. 3, 1957, 255–269
Williams, A. C.: Marginal Values in Linear Programming, J. of SIAM, Vol. 11, 1963, 82–94
Cottle, R. W. and Dantzig, G. B.: Complementary Pivot Theory of Mathematical Programming, Linear Algebra and its Applications, Vol. 1, 1968, 103–125
Bloech, J.: Lineare Optimierung für Wirtschaftswissenschaftler, Westdeutscher Verlag, Opladen, 1974
Shanno, D. F.: Computing Karmarkar Projections Quickly, Mathematical Programming, Vol. 41, No. 1, 1988, 61–71
Dennis, J. E. Jr., Morshedi, A. M., and Turner, K.: Variable-Metric Variant of the Karmarkar Algorithm for Linear Programming, Math. Programming, Vol. 39, No. 1, 1987, 1–20
Zimmermann, H.-J. und Zielinski, J.: Lineare Programmierung-ein programmiertes Lehrbuch, Berlin, 1971
Boot, J. C. G.: On Trivial and Binding Constraints in Programming Problems, Mgmt. Sci., Vol. 8, No. 4, 1962, 419–441
Bixby, R. and Wagner, D.: A Note on Detecting Simple Redundancies in Linear Systems, Oper. Res. Letters, Vol. 6, No. 1, 1987, 15–17
Charnes, A., Cooper, W., and Thompson, G.: Some properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Progr. Probl., Oper. Res., Vol. 10, 1962
Thompson, G., Tonge, F., and Zionts, S.: Techniques for Removing Non-binding Constraints and Extraneous Variables from Linear Progr. Probl., Mgmt. Science, Vol. 12, No. 7, 1966, 588–608
Tomlin, J. and Welch, J.: Finding Duplicate Rows in a Linear Programming Model, Operations Research Letters, Vol. 5, No. 1, 1985, 7–11
Megiddo, N. and Shub, M.: Boundary Behavior of Interior Point Algorithms in Lin. Progr., Math. Oper. Res., Vol. 14, No. 1, 1989, 97
Vanderbei, R.J.: Affine-Scaling for Linear Programs With Free Variables, Math. Progr. Ser. A, Vol. 43, No. 1, Jan. 1989, 31–44
Caron, R. J. and McDonald, J. F.: New Approach to the Analysis of Random Methods for Detecting Necessary Linear Inequality Constraints, Math. Progr. Ser. A, Vol. 43, No. 1, 1989, 97–102
Bixby, R. E. and Cunningham, W. H.: Converting Linear Programs to Network Probl., Math. of Oper. Res., Vol. 5, No. 3, 1980, 321–357
Wagner, H. M.: A Comparison of the Original and the Revised Simplex Methods, Operations Research, Vol. 5, 1957, 361–369
Shanno, D. F. and Marsten, R. E.: Reduced-Gradient Variant of Karmarkar’s Algorithm and Nullspace Projections, J. Optim. Theory and Appl., Vol. 57, No. 3, 1988, 383–397
Scolnik, H.: A New Approach to Linear Programming, SIGMAP Newsletter, No. 15, 1973, 35–42
Forrest, J. J. H. and Tomlin, J. A.: Updated Triangular Factors of the Basis to Maintain Sparsity in the Product Form Simplex Meth., Math. Progr., Vol. 2, 1972, 263–278
Hattersley, B. and Wilson, J.: A Dual Approach to Primal Degeneracy, Math. Progr., Vol. 42, 1988, 135–145
Charness, A.: Optimality and Degeneracy in Linear Programming, Econometrica, Vol. 20, 1952, 160–170
Bland, R. G.: New Finite Pivoting Rules for the Simplex Method, Mathematics of Operations Research, Vol. 2, 1977, 103–107
Tomlin, J. A. and Welch, J. S.: Formal Optimization of Some Reduced Linear Programming Problems, Math. Progr., Vol. 27, 1983, 232–240
Mitra, G., Tamiz, M., and Yadegar, J.: Experimental Investigation of an Interior Search Method within a Simplex Framework, Comm. of the ACM, Vol. 31, No. 12, 1988, 1474–1482
Borgwardt, K. H.: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex-Method, Math. of Oper. Res., Vol. 7, No. 3, 1982, 441–462
Murty, K. G. and Fathi, Y. A.: Feasible Direction Method for Linear Progr., Oper. Res. Letters, Vol. 3, No. 3, 1984, 121–127
Nickels, W. W., Rodder, L. X. U., and Zimmermann, H.-J.: Intelligent Gradient Search in Linear Programming, Eur. J. Oper. Res., Vol. 22, 1985, 293–303
Sherali, H. D., Soyster, A. L., and Baines, S. G.: Nonadjacent Extreme Point Methods for Solving Linear Programs, Nay. Res. Logist. Quarterly, Vol. 30, 1983, 145–161
Tamiz, M.: Design, Implementation and Testing of a General Linear Programming System Exploiting Sparsity, Ph.D. Thesis, Dept. of Math. and Statistics, Brunel Univ., London, 1986
Mangasarian, O. L.: Iterative Solution of Linear Programs, SIAM J. Numerical Analysis, Vol. 18, No. 4, 1981, 606–614
Gonzaga, C. C.: Conical Pojection Algorithms for Linear Programming, Math. Progr., Vol. 43, 1989, 151–173
Adler, I., Resende, M. and Veiga, G.: An Implementation of Karmarkar’s Algorithm for Linear Programming, Report ORC86–8, Oper. Res. Center, Univ. of California, Berkeley, CA., 1986
Sherali, H. D.: Algorithmic Insights and a Convergence Analysis for a Karmarkar-Type of Algorithm for Linear Programming Problems, Nay. Res. Logist. Quart., Vol. 34, 1987, 399–416
Ho, J. K. and Loute, E.: An Advanced Implementation of the Dantzig-Wolfe Decomposition Algorithm for Linear Programming, Math. Progr., Vol. 20, 1981, 303–326
Orchard-Hays, W.: Background, Development and Extensions of the Revised Simplex-Method, RM-1433, The RAND Corp., 1954
Kalan, J. E.: Aspects of Large-Scale In-Core Linear Programming, in Proceedings of the 1971 Annual Conference of the ACM, Chicago, IL., 1971, 304–313
Schrage, L.: Implicit Representation of Variable Upper Bounds in Linear Progr., Math. Progr. Studies, Vol. 4, 1975, 118–132
Sethi, A. P.: The Pivot and Probe Algorithm for Solving a Linear Program, Math. Progr., Vol. 29, No. 2, 1984, 219–233
Iri, M. and Imai, H.: A Multiplicative Barrier Function Method for Linear Programming, Algorithmica, Vol. 1, 1986, 455–482
Ferris, M. C. and Philpott, A. B.: Some Remarks on Karmarkar’s Algorithm, Cambridge Univ., Engineering Dept., Report CUED/F-CAMS/TR 251, Cambridge, Mass., 1985
Schönlein, A.: Der Algorithmus von Khachian, Angewandte Informatik, No. 3, 1981, 115–121
Murty, K. G.: Linear Programming, Wiley, New york, 1983
Murty K. G.: Linear and Combinatorial Programming, Wiely, New York, 1976
Schönlein, A.: Der Algorithmus von Karmarkar—Idee, Realisation, Beispiel und numerische Erfahrungen, Angewandte Informatik, No. 8, 1986, 344–353
Aucamp, D. C., and Steinberg, D. I.: The Computation of Shadow Prices in Linear Progr., J. Oper. Res. Soc., Vol. 33, 1982, 557–565
Williams, H. P.: Restricted Vertex Generation Applied as a Crashing Procedure for Linear Programming, Computers and Oper. Res., Vol. 11, 1984, 401–407
Akgul, M.: Topics in Relaxation and Ellipsoidal Methods, Pitman, Boston, 1984
Nichels, W., Rodder, W., Xu, L., and Zimmermann, H.-J.: Intelligent Gradient Search for Linear Programming, Institutsbericht 85/08 des Lehrstuhls für Unternehmensforschung der RWTH, Aachen, 1985
Hacijan, L. G.: A Polynomial Algorithm in Linear Programming, Soviet Mathematics—Doklady, Vol. 20, No. 1, 1979, 191–194
Brown, G. G., Mc Bride, R. D., and Wood, R. K.: Extracting Embedded Generalized Networks from Linear Programming Problems, Math. Progr., Vol. 32, 1985, 11–31
Cooper, L. and Kennington, J.: Non-Extreme Point Solution Strategies for Linear Programs, Naval Research Logistics Quarterly, Vol. 26, No. 3, 1979, 447–461
Schrage, L.: On Hidden Structures in Linear Progr., in X-174, 1981
Mc Bride, R.: Solving Embedded Generalized Network Problems, Eur. J. Oper. Res., Vol. 21, 1985, 82–92
Cooper, L. and Steinberg, D.: Methods and Applications for Linear Programming, W. B. Saunders, Philadelphia, 1974
Bazaraa, M. S. and Jarvis, J. J.: Linear Programming and Network Flows, Wiley, New York, 1977
Ho, J. K.: Recent Advances in the Decomposition Approach to Linear Programming, Math. Programming Study, No. 31, 1987, 119–128
Gass, S. I.: Linear Programming—Methods and Applications, Mc Graw-Hill, New York, 1964
Gass, S. I.: An Illustrated Guide to Linear Programming, Mc Graw-Hill, New York, 1970
Kotiah, T. C. T. and Steinberg, D. I.: On the Possibility of Cycling with the Simplex-Meth., Oper. Res., Vol. 26, No. 2, 1978, 374–376
Dantzig, G. B.: Linear Programming under Uncertainty, Management Science, Vol. 1, 1955, 197–206
Krelle, W. und Kuenzi, H. P.: Lineare Programmierung, Verlag Industrielle Organisation, Zuerich, 1958
Kreko, B.: Linear Programming, Pitman, London, 1968
Schrijver, A.: Theory of Linear and Integer Programming, Wiley, Chichester, 1986
Fathi, Y. A. and Murty, K. G.: Computational Behavior of a Feasible Direction Method for Linear Programming, Eur. J. Oper. Res., Vol. 40, No. 3, 1989, 322–328
Anstreicher, K. M.: The Worst-Case Step in Karmarkar’s Algorithm, Math. of Oper. Res., Vol. 14, No. 2, 1989, 294–302
Dodani, M. H. and Babu, A. J. G.: Karmarkar’s Projective Method for Linear Programming—A Computational Appraisal, Comp. Ind. Eng., Vol. 16, No. 1, 1989, 189–206
Renegar, J.: A Polynomial-Time Algorithm Based on Newton’s Method for Linear Programming, Math. Progr., Vol. 40, 1988, 59–93
Dantzig, G. B.: Upper Bounds, Secondary Constraints and Block Triangularity in Lin. Progr., Econometrica, Vol. 23, 1955, 174–183
Wendell, R. E.: The Tolerance Approach to Sensitivity Analysis in Lin. Progr., Oper. Res., Vol. 31, 1985, 564–578
Tomlin, J. A.: A Note on Comparing Simplex and Interior Methods for Linear Programming, in VIII.1. 1–125, 1988
Adler, I., Karmarkar, N., Resende, M. G. C., and Veiga, G.: Data Structures and Programming Techniques for the Implementation of Karmarkar’s Algorithm, Technical Report, Dept. of IE/OR, Univ. of California, Berkeley, CA., 1987
Suhl, U. and Aittoniemi, L.: Computing Sparse LU-Factorizations for Large-Scale Linear Programming Bases, Arbeitspapier 58/87, Fachbereich Wirtschaftswissenschaften, Angewandte Informatik, Freie Universität Berlin, 1987
Derigs, U.: Neuere Ansätze in der Linearen Optimierung—Motivation, Konzepte and Verfahren, in Oper. Res. Proc. 1985, Springer, Berlin, 1986
Ye, Y.: Interior Algorithms for Linear, Quadratic and Linearly Constrained Convex Programming, Ph.D. Thesis, Dept. of Eng.-Econ. Systems, Stanford Univ., CA., 1987
Avis, D. and Chvatal, V.: Notes on Bland’s Pivoting Rule, Math. Programming Study, Vol. 8, 1978, 24–34
Cunningham, W. H.: A Network Simplex Method, Mathematical Programming, Vol. 11, 1976, 105–116
Barr, R. S., Glover, F., and Klingman, D.: The Alternating Basis Algorithm for Assignment Problems, Math. Progr., Vol. 13, 1977, 1–13
Roohy-Laleh, E.: Improvements of the Theoretical Efficiency of the Network Simplex Method, M.Sc. Thesis, Ottawa, 1981
Rinnooy Kan, A. H. G. and Talgen, J.: The Complexity of Linear Programming, Statistica Nederlandica, 1981, 91–107
Culioli, J.-C. and Protopopescu, V.: New Algorithm for Linear Programming That is Easy to Implement—Application to the Transportation Problem, Oak Ridge National Lab., Tennessee, 1988
Goldfarb, D. and Mehrotra, S.: A Relaxed Version of Karmarkar’s Method, Math. Progr., Vol. 40, 1988, 289–315
Goldfarb, D. and Reid„ J. K.: A Practicable Steepest-Edge Simplex Algorithm, Math. Progr., Vol. 12, 1977, 361–371
Anstreicher, K. M.: Strengthened Acceptance Criterion for Approximate Projections in Karmarkar’s Algorithm, Oper. Res. Letters, Vol. 5, No. 4, 1986, 211–214
Pickel, P. F.: Approximate Projections for the Karmarkar Algorithm Theory, Polytechnic Institute of New York, Farmingdale, 1985
Pan, V.: On the Complexity of a Pivot Step of the Revised Simplex Method, Computers and Math., Vol. 11, No. 11, 1985, 1127–1140
Volkovich, V. L., Voynalovich, V. M., and Kudin, V. I.: Relaxation Scheme of Dual Row Simplex Method, Sov. J. Automation Inf. Sci., Vol. 21, No. 1, 1988, 37–43
Blum. L.: Towards an Asymptotic Analysis of Karmarkar’s Algorithm, Information Processing Letters, Vol. 23, 1986, 189–194
Barnes, E. R.: A Variation on Karmarkar’s Algorithm for Solving Linear Progr. Problems, Math. Progr., Vol. 36, 1986, 174–182
Anstreicher, K. M.: Combined Phase I—Phase II Projective Algorithm for Linear Programming, Math. Progr., Ser. A, Vol. 43, No. 2, 1989, 209–223
Anstreicher, K. M.: A Monotonic Projective Algorithm for Fractional Linear Programming, Algorithmica, Vol. 1, 1986, 483–498
De Ghellinck, G. and Vial, J.: A Polynomial Newton Method for Linear Programming, Algorithmica, Vol. 1, 1986, 425–453
Ye, Y. and Kojima, M.: Recovering Optimal Dual Solutions in Karmarkar’s Polynomial Algorithm for Linear Programming, Math. Progr., Vol. 39, 1987, 305–317
Smythe, W. R. and Johnson, L. A.: Introduction to Linear Programming with Applications, Prentice-Hall, Englewood Cliffs, N. J., 1966
Olson, M. P.: Dynamic Factorization in Large-Scale Optimization, Naval Postgraduate School, Monterey, CA., 1989
Tomlin, J. A.: Modifying Triangular Factors of the Basis in the Simplex Method, in VIII. 2–59, 1972, 77–85
Tomlin, J. A.: Survey of Computational Methods for Solving Large Scale Systems, Stanford Univ., Report TR72–25, 1972
Tomlin, J. A.: On Pricing and Backward Transformation in Linear Programming, Stanford Univ., Report TR72–21, 1972
Benson, H. P. and Erenguc, S. S.: Using Convex Envelopes to Solve the Interactive Fixed-Charge Linear Programming Problem, J. Optim. Theory and Appl., Vol. 59, No. 2, 1988, 223–246
Erenguc, S. S. and Benson, H. P.: The Interactive Fixed-Charge Lin. Progr. Probi., Nay. Res. Logist. Quart., Vol. 33, 1986, 157–177
Traub, J. and Wozniakowski, H.: Complexity of Linear Programming, Operations Research Letters, Vol. 1, 1982, 59–62
Lovasz, L.: A New Linear Programming Algorithm—Better or Worse Than the Simplex Method?, The Mathematical Intelligencer, Vol. 2, 1980, 141–146
Tardos, E.: A Strongly-Polynomial Algorithm to Solve Combinatorial Linear Programs, Oper. Res., Vol. 34, No. 2, 1986
Dantzig, G. B.: Optimal Solution to a Dynamic Leontief Model with Substitution, Econometrica, Vol. 23, 1955, 295–302
Koehler, G. J., Whinston, A. B., and Wright, G. P.: The Solution of Leontief Substitution Systems Using Matrix Inversion Techniques, Mgmt. Sci., Vol. 21, No. 11, 1975
Wagner, H.: A Linear Programming Soluiton to Dynamic Leontief Type Models, Mgmt. Sci., 1957
Veinott, A. F. Jr.: Extreme Points of Leontief Substitution Systems, Linear Algebra and its Applications, Vol. 1, 1968, 181–194
Fourer, R.: Solving Staircase Linear Programs by the Simplex Method-1. Inversion, Math. Progr., Vol. 23, 1982, 274–313
Fourer, R.: Solving Staircase Linear Programs by the Simplex Method-2. Pricing, Math. Progr., Vol. 25, 1983, 251–292
Bartels, R. H. and Golub, G. H.: The Simplex Method Using LU Decomposition, Communications of the ACM, Vol. 12, 1969, 266–268
Propoi, A. and Krivonozhko, V.. E.: The Simplex Method for Dynamic Lin. Progr., Report RR-78–14, Int. IASA, Laxenburg, Austria, 1978
Berbee, H. C. P. et al.: Hit-and-Run Algorithms for the Identification of Nonredundant Linear Inequalities, Mathematical Progr., Vol. 37, 1987, 184–207
Caron, R. J. and Mc Donald, J. F.: A New Approach to the Analysis of Random Methods for Detecting Necessary Linear Inequality Constraints, Math. Progr., Vol. 43, 1989, 97–102
Jeroslow, R. G.: Asymptotic Linear Programming Operations Research, Vol. 21, 1973, 1128–1141
Carstens, D. M.: Crashing Techniques, in VIII.1. 1–10, 1968, 131–139
Gould, N. I. M. and Reid, J. K.: New Crash Procedures for Large Systems of Linear Constraints, Math. Progr. Ser. B., Vol. 45, No. 3, 1989, 475–501
Murray, W.: Methods for Large-Scale Linear Programming, in VIII.1. 1–148, 1989, 115–137
Kaufmann, A. and Henry-Larbordere, A.: Integer and Mixed-Integer Programming: Theory and Appl., Academic Press, New York, 1977
Benichou, M., Gauthier, J. M., Girodet, P., Hentges, G., Ribiere, G., and Vincent, O.: Experiments in Mixed-Integer Programming, Math. Programming, Vol. 1, 1971, 76–94
IBM: An Introduction to Modelling Using Mixed–Integer Programming, Form–No. GE19–5043–2, 1975
Suhl, U.: Solving Large Scale Mixed-Integer Programs with Fixed-Charge Variables, Math. Progr., Vol. 32, 1985
Benders, J. F.: Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik, Vol. 4, 1962, 238–252
Benders, J. F.: Partitioning in Mathematical Programming, Thesis Univ. of Utrecht, 1960
Cote, G. and Laughton, M. A.: Large-Scale Mixed-Integer Programming—Benders-Type Heuristics, Eur. J. Oper. Res., Vol. 16, No. 3, 1984
Mitra, G.: Investigations of Some Branch and Bound Strategies for the Solution of Mixed-Integer Linear Programs, Math. Progr., Vol. 4, 1973, 155–170
Singhal, J.: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming, Diss., Department of Management Inf. Systems, Univ. of Arizona, 1982
Szwarc, W.: The Mixed-Integer Linear Programming problem When the Integer Variables are Zero or One, Carnegie Inst. Technology, 1963
Harris, P. M. V.: An Algorithm for Solving Mixed-Integer Linear Programmes, Operational Res. Quart., Vol. 15, 1964, 117–132
Driebeek, N. J.: An Algorithm for the Solution of Mixed-Integer Programming Problems, Mgmt. Sci., Vol. 12, 1966, 576–587
Dakin, R. J.: A Tree Search Algorithm for Mixed-Integer Programming Problems, The Computer Journal, Vol. 8, 1965, 250–255
Lemke, C. E. and Spielberg, K.: Direct Search Zero-One and Mixed-Integer Progr., IBM New York Sci. Center, Report No. 39008, 1966
Bennet, J. M. and Dakin, R. J.: Experience with Mixed-Integer Linear Programming Problems, Univ. of Sydney, Mimeographed Report, 1961
Davis, R. E., Kendrick, D. A., and Weitzman, M.: A Branch and Bound Algorithm for Zero-One Mixed-Integer Programming Problems, Oper. Res., Vol. 19, No. 4, 1971, 1036–1044
Armstrong, R. D. and Sinha, P.: Improved Penalty Calculations for a Mixed-Integer Branch and Bound Algorithm, Math, Progr., Vol. 6, 1974, 212–223
Benichou, M., Gauthier, J. M., Hentges, G., and Ribiere, G.: The Efficient Solution of Large Scale Linear Programming Problems—Some Algorithmic Techniques and Computational Results, Math. Progr., Vol. 13, 1977, 280–322
Gauthier, J.-M. and Ribiere, G.: Experiments in Mixed-Integer Linear Programming Using Pseudo-Costs, Math. Progr., Vol. 12, 1077, 26–47
Meyer, R. R.: A Theoretical and Computational Comparison of `Equivalent’ Mixed-Integer Formulations, Nay. Res. Logist. Quart., Vol. 28, 1981, 115–131
Williams, H. P.: Model Building in Linear and Integer Programming, in VIII.1. 1–92, 1984
Williams, H. P.: The Reformulation of Two Mixed-Integer Programming Problems, Math. Progr., Vol. 14, 1978, 325–331
Meyer, R. R.: Integer and Mixed-Integer Programming Models—General Properties, J. Opt. Theory and Appl., Vol. 16, 1975, 191–206
Williams, A. C.: Marginal Values in Mixed-Integer Linear Programming, Math. Progr., Vol. 44, 1989, 67–75
Williams, H. P.: The Economic Interpretation of Duality in Mixed Integer Programming Models, in VIII.1. 1–120, 1979
Van Roy, T. J. and Wolsey, L. A.: Solving Mixed-Integer Programming Problems Using Automatic Reformulation, Oper. Res., Vol. 29, 1981, 49–74
Bush, R. L.: Restructuring and Solving Zero-One Integer and Fixed-Charge Mixed-Integer Programming Problems, Ph. D. Diss., Stanford Univ., 1972
Wolsey, L. A.: Strong Formulations for Mixed-Integer Programming—A Survey, Math. Progr., Ser. B, Vol. 45, No. 1, 1989, 173–191
Van Roy, T. J. and Wolsey, L. A.: Solving Mixed 0–1 Programs by Automatic Reformulation, Oper. Res., Vol. 35, 1987, 45–57
Van Roy, T. J. and Wolsey, L. A.: Valid Inequalities for Mixed 0–1 Programs, Discrete Applied Mathematics, Vol. 14, 1986, 199–213
Martin, R. K., Sweeney, D. J., and Doherty, M. E.: The Reduced Cost Branch and Bound Algorithm for Mixed-Integer Programming, Comp. Oper. Res., Vol. 12, 1985, 139–149
Martin, R. K.: Generating Alternative Mixed-Integer Linear Programming Models Using Variable Redefinition, Oper. Res., Vol. 35, 1987, 820–831
Admas, W. P. and Sherali, H. D.: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems, Oper. Res., Vol. 38, No. 2, 1990, 217–226
Johnson, E. L.: Modeling and Strong Linear Programs for Mixed Integer Programming, in VIII.1. 1–148, 1989
Kaufmann, A. and Henry-Larbordere, A.: Integer and Mixed-Integer Programming: Theory and Appl., Academic Press, New York, 1977
Zionts, S.: Linear and Integer Programming, Prentice-Hall, Englewood Cliffs, N. J. 1974
Salkin, H. M.: Integer Progr., Addison-Wesley, Reading, Mass., 1975
Beale, E. M. L.: Survey of Integer Programming, Operational Research Quarterly, Vol. 16, 1965, 219–228
Teruo, J.: Numerische Verfahren der Diskreten Optimierung, Teubner, Leipzig, 1981
Burkard, R. E.: Methoden der Ganzzahligen Optimierung, Springer, Berlin, 1972
Balinski, M. L.: Integer Programming, Methods, Uses, Computation, Mgmt. Sci., Vol. 12, No. 3, 1965, 253–313
Abadie, J. (Editor): Integer and Nonlinear Programming, North-Holland, Amsterdam, 1970
Ibaraki, T.: Integer Programming Formulation of Combinatorial Optimization Problems, Discrete Math., Vol. 16, 1976, 39–52
Garfinkel, R. S. and Nemhauser, G. L.: Integer Progr., New York, 1972
Hammer, P. L. and Rudeanu, X.: Boolean Methods in Operations Research and Related Areas, Springer, Berlin, 1968
Hu, T. C.: Integer Progr. and Network Flows, Addison-Wesley, Reading, Mass., 1970
Taha, H. A.: Integer Programming—Theory, Applications and Computations, Academic Press, New York, 1975
Williams, H. P.: Experiments in the Formulation of Integer Programming Problems, Math. Progr. Study 2, 1974, 180–197
Crowder, H., Johnson, E. L., and Padberg, M. W.: Solving Large-Scale Zero-One Linear Programming Problems, Operations Research, Vol. 31, No. 5, 1983, 803–834
Johnson, E. L., Kostreva, M. M., and Suhl, U.: Solving 0–1 Integer Programming Problems Arising From Large Scale Planning Models, Operations Research, 1982
Glover, F. and Woolsey, E.: Converting the 0–1 Polynomial Programs to a 0–1 Linear Program, Oper. Res., Vol. 22, 1974, 180–182
Balas, E. and Mazzola, J. B.: Nonlinear 0–1 Programming, Part I: Linearization Techniques, Math. Progr., Vol. 30, 1984
Balas, E. and Mazzola, J. B.: Nonlinear 0–1 Programming, Part II: Dominance Relations and Algorithms, Math. Progr., Vol. 30, 1984
Spielberg, K.: Enumerative Methods in Integer Programming, Annals of Discrete Mathematics, Vol. 5, 1979, 139–183
Guignard, M. and Spielberg, K.: Logical Reduction Methods in Zero-One Programming—Minimal Prefereed Variables, Oper. Res., Vol. 29, No. 1, 1981, 49–74
Johnson, E. L. and Suhl, U.: Experiments in Integer Programming, Discrete Applied Mathematics, Vol. 2, 1980
Suhl, U.: Entwicklung von Algorithmen für ganzzahlige Optimierungsmodelle, Beiträge zur Unternehmensforschung, Heft 6, Freie Universität Berlin, 1975
Bouvier, B. et Messoumian, G.: Programmes lineaires en variables bivalentes, These, Univ. de Grenoble, 1965
Austin, L. M. and Ruparel, B. C.: The Mixed Cutting Plane Algorithm for All-Integer Programming, Computers and Oper. Res., Vol. 13, No. 4, 1986, 395–401
Onyekwelu, D. C.: Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems, Oper. Res., Vol. 31, 1983, 795–801
Hanna, M. E.: An Advanced Start-Algorithm for All-Integer Programming, Ph.D. Diss., College of Business Admin., Texas Technical Univ., Lubbock, Texas, 1981
Dragan, I.: Un algorithme lexicographique pour la resolution des programmes lineaires en variables binaires, Mgmt. Sci., Vol. 16, No. 3, 1969, 246–252
Guignard, M.: Methodes heuristiques de resolution d’un systeme d’inegalites lineaires en variables entires ou bivalentes, Publ. du Lab. de Calcul, Rapp. 32, Univ. de France, Lille, 1972
Gomory, R. E.: On the Relation Between Integer and Non-Integer Solutions to Linear Programs, Proceedings of the National Academy of Science, Vol. 53, 1965, 260–265
Fleischmann, B.: Lösungsverfahren und Anwendungen der ganzzahligen linearen Optimierung, Thesis, Hamburg, 1967
Rubin, D. S.: On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint, Oper. Res., Vol. 18, No. 5, 1970, 940–946
Miller, C. E., Tucker, A. W., and Zemlin, R. A.: Integer Progr. Formulation of Travelling Salesman Probl., J. ACM, Vol. 7, 1960, 326–329
Gomory, R. E.: Solving Linear Programming Problems in Integers in VIII.1. 6–61, 1960, 211–216
Gomory, R. E. and Baumol, W. J.: Integer Programming and Pricing, Econometrica, Vol. 28, 1960, 521–550
Gomory, R. E. and Hoffman, A. J.: On the Convergence of an Integer Progr. Process, Na. Res. Logist. Quart., Vol. 10, 1963, 121–123
Haldi, J.: 25 Integer Programming Test Problems, Working Paper No. 43, Graduate School of Business, Stanford Univ., 1966
Lemke, C. E. and Spielberg, K.: Direct Search Zero-One and Mixed Integer Progr., IBM New York Sci. Center, Report No. 39008, 1966
Balas, E.: An Additive Algorithm for Solving Linear Programs With Zero-One Variables, Operations Research, Vol. 13, 1965, 517–546
Bradley, G. H., Hammer, P. L., and Wolsey, L. A.: Coefficient Reduction for Inequalities in 0–1 Var., Math. Progr., Vol. 7, 1975, 263–282
Ibaraki, T., Liu, T. K., Baugh, C. R., and Muroga, S.: An Implicit Enumeration Progam for Zero-One Integer Programming, Int. J. of Computer and Information Sciences, Vol. 1, 1972, 75–92
Bazaraa, M. S. and Elshafei, A. N.: On the Fictitious Bounds in Tree Search Algorithms, Mgmt. Sci., Vol. 23, 904–908
Hanna, M. E. and Austin, L. M.: An Advanced Start Algorithm for All-Integer Programming, Comput, Opns. Res., Vol. 12, 1985, 301–310
Gomory, R. E.: Outline of an Algorithm for Integer Solutions to Linear Programs, Bull. Am. Math. Soc., Vol. 64, 1958, 275–278
Ruparel, B. C.: The Bounded Enumeration Algorithm for All-Integer Programming, Ph.D. Diss., College of Business Admin., Taxes Techn. Univ., Lubbock, Texas, 1983
Balas, E.: Linear Programming with Zero-One Variables, Proc. Third Scientific Session on Statistics, Bucharest, December 5–7, 1963
Balas, E.: Duality and Pricing in Integer Programming, Stanford Univ., Stanford, Cal., 1967
Balinski, M. L.: On Finding integer Solutions to Linear Programs, Proc. of the IBM Sci. Symposium on Comb. Problems, 1965
Padberg, M. W.: Essays in Integer Programming, Ph.D. Thesis, Carnegie Mellon Univ., Pittsburgh, 1971
Glover, F.: New Results-on Equivalent Integer Programming Formulations, Mgmt. Sci., Vol. 8, 1975, 84–90
Tomlin, J. A.: An Improved Branch-and-Bound Method for Integer Programming, Oper. Res., Vol. 19, No. 4, 1971, 1070–1075
Piehler, J.: Ganzzahlige Linear Optimierung, Teubner Verlagsgesellschaft, Leipzig, 1970
Kreuzberger, H.: Ein Näherungsverfahren zur Bestimmung ganzzahliger Lösungen bei Linearen Optimierungsproblemen, Ablauf-und Planungsforschung, Vol. 9, 1968, 137–152
Burkard, R. E. and Stratmann, K. H.: Numerical Investigations on Quadratic Assignment Problems, Nay. Res. Logist. Quart., Vol. 25, 1979, 129–144
Wilhelm, M. R. and Ward, T. L.: Soving Quadratic Assignment Problems by Simulated Annealing, IIE Trans, Vol. 19, No. 1, 1987, 107–119
Lawler, E. L.: The Quadratic Assignment Problem, Mgmt. Sci., Vol. 9, 1963
Beale, E. M. L.: Integer Programming, in VIII.1. 1–67, 1977, 409–448
Kim, S. and Cho, S.-C.: Shadow Price in Integer Programming for Management Decision, Eur. J. Oper. Res. Vol. 37, No. 3, 1988, 328–335
Scott, J. L.: On an Integral Transformation for Integer Programming, Oper. Res. Letters, Vol. 7, No. 4, 1988, 189–190
Guignard, M., Spielberg, K., and Suhl, U.: Survey of Enumerative Methods for Integer Programming, Univ. of Pennsylvania, The Wharton School, Technical Report 41, 1978
Greenberg, H.: A Dynamic Programming Solution to Integer Linear Prog., J of Math. Anal. and Appl., Vol. 26, No. 2, 1969, 454–459
Toyoda, Y.: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Progr. Probl., Mgmt. Sci. Vol. 21, 1975, 1417
Ram, B. (Balasubramanian) and Karwan, M. H.: Result in Surrogate Duality for Certain Integer Programming Problems, Math. Progr., Ser. A, Vol. 43, No. 1, Jan. 1989, 103–106
Fisher, M. L.: The Lagrangean Relaxation Method for Solving Integer Programming Problems, Mgmt. Sci., Vol. 27, 1981, 1–18
Geoffrion, A. M.: Lagrangean Relaxation for Integer Programming, Math. Progr. Studies, No. 2, 1974, 82–114
Beale, E. M. L.: Integer Programming, In VIII.1. 1–92, 1984, 1–24
Geoffrion, A. M. and Marsten, R. E.: Integer Programming Algorithms—A Framework and State-of-the-Art Survey, Mgmt. Sci., Vol. 18, 1972, 465–491
Jeroslow, R. G. and Lowe, J. K.: Modelling with Integer Variables, Mathematical Programming Study, Vol. 22, 1984, 167–184
Glover, F.: Improved Linear Integer Programming Formulations of Nonlin. Integer Probl., Mgmt. Sci., Vol. 22, No. 4, 1975, 455–459
Nauss, R. M.: Parametric Integer Programming, Univ. of Missouri Press, Columbia and London, 1979
Hammer, P. L., Johnson, E. L., Korte, B. H., and Nemhauser, G. L.: Studies in Integer Programming, North-Holland, Amsterdam, 1977
Senju, S. and Toyoda, Y.: An Approach to Linear Programming with 0–1 Variables, Mgmt. Sci., Vol. 15, 1968, 196–207
Glover, F.: A Multiple-Dual Algorithm for the Zero-One Integer Programming Problem, Oper. Res., Vol. 13, 1965, 879–919
Glover, F. and Mulvey, J.: Equivalence of the 0–1 Integer Programming Problem to Discrete Generalized and Pure Networks, Oper. Res., Vol. 28, 1980, 829–835
Granot, F. and Hammer, P. L.: On the Use of the Boolean Functions in 0–1 Programming, Math. Oper. Res., Vol. 12, 1972, 154–184
Hammer, P. L., Johnson, E. L., and Korte, B. H. (Eds.): Discrete Optimization, Annals of Discrete Mathematics, Vol. 5, 1979
Roodman, G. M.: Postoptimality Analysis in Zero-One Programming by Impl. Enumeration, Nay. Res. Log. Quart., Vol. 19, 1972, 435–447
Frank, M. and Wolfe, P.: An Algorithm for Quadratic Programming, Naval Res. Log. Quarterly, Vol. 3, 1956, 95–110
Saaty, T. L.: Optimization in Integers and Related Extremum Problems. Mc Graw-Hill, New York, 1970
Wolsey, L. A.: Facets and Strong Valid Inequalities for Integer Programs, Oper. Res., Vol. 24, 1976, 367–372
Radke, M. A.: Sensitivity Analysis in Discrete Optimization, Ph.D. Thesis, Univ. of California, Los Angeles, 1975
Nauss, R. M.: Parametric Integer Programming, Ph.D Thesis, University of California, Los Angeles, 1975
Geoffrion, A. M. and Nauss, R. M.: Parametric and Postoptimality Analysis in Integer Linear Programming, Mgmt. Science, Vol. 23, 1977
Wolsey, L. A.: Integer Programming Duality—Price Function and Sensitivity Analysis, Math. Progr., 1981, 173–195
Martin, R. K. and Sweeney, D. J.: An Ideal Column Algorithm for Integer Programs with Special Ordered Sets of Variables, Math. Progr., Vol. 26, 1983, 48–63
Padberg, M. W.: Equivalent Knapsack-Type Formulations of Bounded Integer Linear Programs—An alternative Approach, Nay. Res. Logist. Quart., Vol. 19, 1972, 669–708
Ram, B. (Balasubramanian), Karwan, M. H. and Babu, A. J. G.: Aggregation of Constraints in Integer Programming, Eur. J. Oper. Res., Vol. 35, 1988, 216–227
Cook, W., Gerards, A. M. H., Schrijver, A. and Trados, E.: Sensitivity Theorems in Integer Linear Programming, Math. Progr., Vol. 34, 1986, 251–264
Cooper, M. W.: A Survey of Methods for Pure Nonlinear Integer Programming, Mgmt. Sci., Vol. 27, No. 3, 1981, 353–361
Nemhauser, G. L. and Wolsey, L. A.: Integer and Combinatorial Programming, Wiley, New York, 1988
Fisher, M. L.: An Application Oriented Guide to Lagrangian Relaxation, Interfaces, Vol. 15, 1985, 10–21
Kendall, K. E. and Zionts, S.: Solving Integer Programming Problems by Aggregating Constraints, Oper. Res., Vol. 25, 1977, 346–351
Hausmann, D. (Ed.): Integer Programming and Related Areas, Springer, Berlin, 1978
Barahona, F., Jünger, M., and Reinelt, G.: Experiments in Quadratic 0–1 Programming, Math. Progr., Vol. 44, 1989, 127–137
Barahona, F.: A Solvable Case of Quadratic 0–1 Programming, Discrete Applied Mathematics, Vol. 13, 1986, 23–26
Pavlov, A. A.: Analysis of Complexity Estimates of Exact Algorithms for Solving the General Linear Integer Programming Problem, Soviet J. of Automation and Inf. Sci., Vol. 18, No. 5, 1985, 40–46
Pavlov, A. A. and Gershgorin, A. Y.: A Method of Reducing a Linear Integer Programming Problem of General Form to a Knapsack Problem, Soviet J. of Autom. and Inf. Sci., Vol. 18, No. 5, 1985, 52–56
Reiter, S. and Rice, D. B.: Discrete Optimization Solution Procedures for Linear and Non-Linear Integer Programming Problems, Mgmt. Science, Vol. 12, No. 11, 1966, 829–850
Wolsey, L. A.: The b-Hull of an Integer Program, Discrete Applied Mathematics, Vol. 3, 1981, 193–201
Balinski, M. L.: On Recent Developments in Integer Programming, in VIII.1. 1–133, 1970, 267–282
Pierce, J. F. and Lasky, J. S.: Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Progr. Probt., Mgmt. Sci., Vol. 19, 1973, 528–544
Korte, B., Krelle, W. und Oberhofer, W.: Ein lexikographischer Suchalgorithums zur Lösung allg. ganzz Programmierungsaufgaben, Unternehmensforschung, Vol. 13, 1964, 73–98 und 172–192
Kreuzberger, H.: Numerische Erfahrungen mit einem heuristischen Verfahrn zur Lösung ganzzahliger linearer Optimierungsprobleme, Elektronische Datenverarbeitung, Vol. 12, 1970, 289–306
Lovasz, L: Graph Theory and Integer Programming, Ann. Discr. Math., Vol. 4, 1979, 141–158
Jeroslow, R. G.: On Algorithms for Discrete Problems, Discr. Math., Vol. 7, 1974, 273–280
Parker, R. G. and Rardin, R. L.: Discrete Optimization, Academic Press, New York, 1988
Simeone, B: Quadratic 0–1 Programming, Ph.D. Diss., Univ. of Waterloo, 1979, Waterloo, Canada
Adams, W. P. and Sherali, H. D.: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems, Mgmt. Sci., Vol. 32, 1986, 1274–1290
Wolsey, L. A.: Valid Inequalities and Superadditivity for 0–1 Integer Programs, Math. of Oper. Res., Vol. 2, No. 1, 1977, 66–77
Wilson, J. M.: Generating Cuts in Integer Progr. with Families of Special Ordered Sets, Eur. J. Oper. Res., Vol. 46, 1990, 101–108
Hadley, G.: Nonlinear and Dynamic Programming, Addison-Wesley Publishing Company, Reading, Mass., 1964
Abadie, J. (Ed.): Nonlinear Programming, North-Holland Publ. Company, Amsterdam, 1967
Abadie, J. (Ed.): Integer and Nonlinear Programming, North-Holland, Amsterdam, 1970
Kuenzi, H. P., Krelle, W. und Von Randow, R.: Nichtlineare Programmierung, 2. Auflage, Springer, Berlin, 1979
Mangasarian, O. L.: Nonlinear Progr., McGraw-Hill, New York, 1969
Fiacco, A. V. and Mc Cormick, G. P.: Nonlinear Programming—Sequential Unconstrained Minimization Techniques, John Wiley, New York, 1968
Powell, M. J. D.: Recent Advances in Unconstrained Optimization, Math. Progr., Vol. 1, 1971, 26–57
Powell, M. J. D. (Ed.): Nonlin. Optimiz., Acad. Press, London, 1981
Balas, E. and Mazzola, J. B.: Nonlinear 0–1 Programming, Part I: Linearization Techniques, Math. Progr., Vol. 30, 1984
Balas, E. and Mazzola, J. B.: Nonlinear 0–1 Programming, Part II: Dominance Relations and Algorithms, Math. Progr., Vol. 30, 1984
Wolfe, P.: The Simplex Method for Quadratic Programming, Econometrica, Vol. 27, No. 3, 1959, 382–398
Dorn, W. S.: Duality in Quadratic Programming, Quarterly of Applied Mathematics, Vol. 18, 1960, 155–162
Zangwill, W. I.: Convergence Conditions for Nonlinear Programming Algorithms, Mgmt. Sci., Vol. 16, No. 1, 1969, 1–13
Faiacco, A. V. and Mc Cormick, G. P.: The Sequential Unconstrained Minimization Technique for Nonlinear Programming, a Primal-Dual Method, Mgmt. Sci., Vol. 10, No. 2, 1964, 360–364
Zoutendijk, G.: Methods of Feasible Directions, Elsevier Publ. Co., Amsterdam, 1960
Zoutendijk, G.: Nonlinear Programming—A Numerical Survey, SIAM J. on Control, Vol. 4, 1966, 194–210
Rosen, J. B.: The Gradient Projection Method for Nonlinear Programming, Part I, Linear Constraints, J. Soc. Ind. Appt. Math., Vol. 8, 1960, 181–217
Flak, J. E.: Lagrange Multipliers and Nonlinear Programming, Journal Math. Anal. Appt., Vol. 19, 1967, 141–159
Hestenes, M. R.: Multiplier and Gradient Methods, Journal Optim. Theory and Applications, Vol. 4, 1969, 303–320
Rockafellar, R. T.: A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization, Math. Progr. Vol.. 5, 1973, 354–373
Curry, H. B.: The Method of Steepest Descent for Non-Linear Minimization Probl., Quart. Appl. Math., Vol. 2, No. 3, 1944, 250–261
Kuenzi, H. P. and Oettli, W.: Integer Quadratic Programming, in VIII.1. 1–32, 1963, 303–308
Himmelblau, D. M.: Appl. Nonlin. Progr., McGraw-Hill, New York, 1972
Arrow, K. J., Hurwicz, L. and Uzawa, H.: Studies in Linear and Non-Linear Programming, Stanford Univ. Press, Stanford, CA., 1972
Barankin, E. W. and Dorfman, R.: On Quadratic Programming, University of California Press, Berkeley, Cal., 1958
Beale, E. M. L.: On Quadratic Programming, Naval Research Logistics Quarterly, Vol. 6, 1959, 227–244
Kleibohm, K.: Ein Verfahren zur approximativen Lösung von konvexen Programmen, Diss., Zürich, 1966
Wilson, R. B.: A Simplicial Method for Concave Programming, Havard Univ., Graduate School of Bus. Admin., Ph.D. Thesis, 1963
Wolfe, P.: A Duality Theorem for Nonlinear Programming, Quarterly Applied Mathematics, Vol. 19, 1961, 239–244
Wolfe, P.: Accelerating the Cutting Plane Method for Nonlinear Programming, J. SIAM, Vol. 9, 1961, 481–488
Wolfe, P.: Some Simplex–Like Nonlinear Programming Procedures, Operations Research, Vol. 10, 1962, 438–447
Wolfe, P.: Convergence Conditions for Ascent Methods, SIAM Review, Vol. 11, 1969, 226–235
Wolfe, P.: On the Convergence of Gradient Methods under Constraint IBM J. of Res. and Dev., Vol. 16, No. 4, 1972, 407–411
Martos, B.: Nonlinear Programming Theory and Methods, American Elsevier Publ. Co., New York, 1975
Maennig, H. G.: Nichtlineare and ganzzahlige Optimierung. Die Bewältigung nichtlin. Teilprobleme innerhalb umfassender LP-Modelle, in VIII.1. 1–55, 1981
Kreko, B.: Optimierung—Nichtlineare Modelle, VEB Deutscher Verlag der Wissenschaften, Berlin, 1974
Miller, C. E.: The Simplex Method for Local Separable Programming, in VIII.1. 1–29, 1963, 89–110
Beale, E. M. L.: Branch-and-Bound Methods for Numerical Optimization of Non-Convex Functions, in VIII.1. 1–64, 1980, 11–20
Beale, E. M. L.: Some Uses of Mathematical Programming Systems to Solve Problems That Are Not Linear, Oper. Res. Quart., Vol. 26, 1975, 609–618
Beale, E. M. L. and Tomlin, J. A.: Special Facilities in a General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables, in VIII.1. 1–65, 1969
Escudero, L. F.: Special Sets in Mathematical Programming State-of-the-Art Survey, in VIII.1. 1–66, 1979, 535–551
Beale, E. M. L. and Forrest, J. J. H.: Global Optimization Using Special Ordered Sets, Math. Progr., Vol. 10, 1976, 52–69
Forsythe, G. E.: Computing Constrained Minima with Lagrange Multipliers, SIAM Journal, Vol. 3, 1958, 173–178
Kuhn, H. W. and Tucker, A. W.: Nonlinear Programming, Proceedings of the 2nd Berkeley Symposium on Math. Statistics and Probability, Univ. of California Press, 1951, 481–492
Dorn, W. S.: On Lagrange Multipliers and Inequalities, Operations Research, Vol. 9, 1961, 95–104
Dorn, W. S.: A Duality Theorem for Convex Programs, IBM Research Journal, Vol. 4, 1960, 407–413
Beale, E. M. L.: On Minimizing a Convex Function Subject to Linear Inequalities, Jour. Royal Statistic Soc., Vol. 17B, 1955, 173–184
Thiel, H. and Van de Panne, C.: Quadratic Progr. as an Extension of Classical Quadratic Maximization, Mgmt. Sci., Vol. 7, 1960, 1–20
Lemke, C. E.: A Method of Solution for Quadratic Programs, Management Science, Vol. 8, 1962, 442–453
Tanaka, Y., Fukushima, M. and Ibaraki, T.: Globally Convergent SQP (Successive Quadratic Programming) Method for Semi-Infinite Nonlinear Optimiz., J. Comp. Appl. Math., Vol. 23, 1988, 141–153
Fan, Y., Sarkar, S., and Lasdon, L.: Experiments with Successive Quadratic Progr. Algorithms, J. Optim. Theory Appl., Vol. 56, No. 3, 1988, 359–383
Tanaka, Y., Fukushima, M. and Ibaraki, T.: comparative Study of Several Semi-Infinite Nonlinear Programming Algorithms, Eur. J. Oper. Res., Vol. 36, No. 1, 1988, 92–100
Hearn, D. W., Lawphongpanich, S., and Ventura, J. A.: Restricted Simplicial Decomposition—Computation and Extensions, Math. Progr. Study, No. 31, 1987, 99–118
Fletcher, R.: An Efficient, Globally Convergent, Algorithm for Unconstrained and Linearly Constrained Optimization Problems, 7th Int. Math. Progr. Symp., The Hague, Netherlands, 1970
Fletcher, R. and Powell, M. J. D.: A Rapidly Convergent Descent Method for Minimization, The Computer Journal, Vol. 6, 1963
Rosen, J. B.: The Gradient Projection Method for Nonlinear Programming, Part II, Nonlin. Constraints, SIAM J., Vol. 9, 1961, 514–532
Goldfeld, S. M., Quandt, R. E., and Trotter, H. F.: Maximization by Quadratic Hill-Climbing, Econometrica, Vol. 34, 1966, 541
Goldfarb, D. and Lapidus, L.: Conjugate Gradient Method for Non-Linear Programming Problems with Linear Constraints, I.and E. C. Fundamentals. Vol. 7, 1968, 142
Pearson, J. D.: Variable Metric Methods of Minimization, Computer Journal, Vol. 12, 1969, 171
Fletcher, R. and Mc Cann, A. P.: Acceleration Techniques for Non-Linear Programming, in VIII.1. 1–85, 1969
Mc Cormick, G. P.: Penalty-Function Versus Non-Penalty-Function Methods for Constrained Nonlinear Programming Problems, Math. Progr., Vol. 1, 1971, 217–238
Mangasarian, O. L.: Nonlinear Programming—Theory and Computation, in VIII.1. 1–86, 1971, 245–265
Zhang, J., Kim, N.-H. and Lasdon, L. S.: An Improved Successive Linear Programming Algorithm, Mgmt. Science, Vol. 31, 1985, 1312–1331
Robinson, S. M.: A Quadratically Convergent Algorithm for General Nonlinear Progr. Problems, Math. Progr., Vol. 3, 1972, 145–156
Murtagh, B. A. and Saunders, M.: A Projected Lagrangean Algorithm and its Implementation for Sparse Nonlinear Constraints, Math. Progr. Study, No. 16, 1982, 84–117
Ecker, J. G. and Kupferschmid, M.: An Ellipsoid Algorithm for Nonlinear Programming, Math. Progr., Vol. 27, 1983, 83–106
Gupta, O. K. and Ravindran. A.: Branch-and-Bound Experiments in Convex Nonlinear Integer Progr., Mgmt. Sci., Vol. 31, 1985, 1533
Fan, Y., Sarkar, S. and Lasdon, L.: Experiments with Successive Quadratic Programming Algorithms, Working Paper, Dept. of General Business, the Univ. of Texas, Austin, Texas, 1985
Baker, T. E. and Lasdon, L. S.: Successive Linear Programming at Exxon Mgmt. Sci., Vol. 31, 1985, 264–274
Falk, J. E.: A Constrained Lagrangean Approach to Nonlinear Programming, Ph.D. Diss., Univ. of Michigan, An Arbor, 1965
Ryan, D. M.: Transformation Methods in Nonlinear Programming, Ph.D. Diss., Australian National Univ., 1971
Fletcher, R.: A General Quadratic Programming Algorithm, J. of the Institute of Mathematics and its Appl., Vol. 7, 1971, 76–91
Hartley, H. O.: Nonlinear Programming by the Simplex Method, Econometrica, Vol. 29, 1961, 223–237
Lemke, C. E.: The Constraint Gradient Method of Linear Programming, J. of the Soc. for Ind. and Appl. Math., Vol. 9, No. 1, 1961, 1–17
Abdadie, J. and Carpentier, J.: Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints, in VIII.1. 1–85, 1969
Abadie, J. and Guigou, J.: Numerical Experiments with the GRG Method, in VIII.1. 5–03, 1970, 529–536
Ech-Cherif, A., Ecker, J. G., and Kupferschmid, M.: Numerical Investigation of Rank-Two Ellipsoid Algorithms for Nonlinear Programming, Math. Progr. Ser. A., Vol. 43, No. 1, 1989, 8795
Ritter, K.: On the Rate of Superlinear Convergence of a Class of Variable Metric Methods, Numerische Math., Vol. 35, 1980, 293–313
Hock, W. and Schittkowski, K.: Test Examples for Nonlinear Programming, Springer, Berlin, 1981
Gill, P. E., Murray, W., Saunders, M. A., and Wright, M. H.: Model Building and Practical Aspects of Nonlinear Programming, in VIII.1. 1–92, 1984, 210–247
Wright, M. H.: Numerical Methods for Nonlinearly Constrained Optimization, Ph.D. Thesis, Stanford Univ., 1976
Tone, K.: Revisions of Constraint Approximations in the Successive QP Method for Nonlin. Progr., Math. Progr., Vol. 26, 1983, 144–152
Brent, R. P.: Algorithms for Minimization Without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973
Stoer, J.: Principles of Sequential Quadratic Programming Methods for Solving Nonlinear Progr., in VIII.1. 1–92, 1984, 1965, 165–207
Ritter, K.: A Method for Solving Problems with a Nonconcave Quadratic Objective Function, Zeitschr, für Wahrscheinlichkeits Theorie and verwandte Gebiete, Vol. 4, 1966, 340–351
Boot, J. C. G.: Quadratic Progr., North Holland, Amsterdam, 1964
Schaible, S.: Beiträge zur Quasikonvexen Programmierung, Dissertation, Universität Köln, 1971
Martos, B.: The Direct Power of Adjacent Vertex Programming Methods, Mgmt. Sci., Vol. 12, 1965, 241–252
Van de Panne, C. and Whinston, A.: Simplicial Methods for Quadratic Programming, Nay. Res. Logist. Quart., Vol. 11, 1964, 273–302
Zowe, J.: Nondifferentiable Optimization, in VIII.1. 1–92, 1984
Bertsekas, D. P.: Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982
Wenger, P.: A Non-Linear Extension of the Simplex-Method, Management Science, Vol. 7, 1960, 43–55
Shanno, D. F. and Phua, K. H.: Numerical Experience with Sequential Quadratic Programming Algorithms for Equality Constrained Nonlinear Programming, ACM Trans. Math. Software, Vol. 15, No. 1, 1989, 49–63
Escudero, L. F.: S3 Sets—An Extension of the Beale-Tomlin Special Ordered Sets, Math. Progr., Vol. 42, No. 1, 1988, 113–123
Kennedy, D.: Some Branch-and-Bound Techniques for Nonlinear Optimization, Math. Progr., Vol. 42, No. 1, 1988, 147–157
Dennis, J. E. Jr.: A User’s Guide to Nonlinear Optimization Algorithms, Proc. of the IEEE, Vol. 72, No. 12, 1984, 1765–1776
Avriel, M.: Nonlinear Programming—Analysis and Methods, Prentice-Hall, Englewood Cliffs, N. J., 1976
Dennis, J. E. Jr. and Schnabel, R. B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englwood Cliffs, N. J., 1983
Bazaraa, M. S. and Shetty, C. M.: Nonlinear Programming—Theory and Algorithms, Wiley, New York, 1979
Bazaraa, M. S. and Sherali, H. D.: On the Choice of Step Size in Subgradient Optimiz., Eur. J. of Oper. Res., Vol. 7, 1981, 380–388
Han, S.-P.: Superlinearly Convergent Variable Metric Algorithms for General Nonlin. Progr. Probl., Math. Progr., Vol. 11, 1976, 263
Han, S.-P.: A Globally Convergent Method for Nonlinear Programming, J. Optimization Theory and Applications, Vol. 22, 1977, 297–309
Veinott, A. F.: The Supporting Hyperplane Method for Unimodal Programming, Oper. Res., Vol. 15, 1967, 147–152
Topkis, D. M. and Veinott, A. F.: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming, SIAM J. on Control, Vol. 5, 1967, 268–279
Di Pillo, G. and Grippo, L.: A New Class of Augmented Lagrangians in Nonlin. Progr., SIAM J. Control Optim., Vol. 17, 1979, 618–628
Fletcher, R.: A New Approach to Variable Metric Algorithms, Comput. J., Vol. 13, 1970, 317–322
Palacios Gomez, F., Lasdon, L., and Engquist, M.: Nonlinear Optimization by Successive Linear Programming, Mgmt. Sci., Vol. 28, 1982, 1106–1120
Pardalos, P. M. and Rosen, J. B.: Methods for Global Concave Minimization—A Bibliographic Survey, SIAM Review, Vol. 28, No. 3, 1986, 367–379
Pardalos, P. M. and Rosen, J. B.: Constrained Global Optimization—Algorithms and Applications, Springer, Berlin, 1987
Kalantari, B.: Large-Scale Global Minimization of Linearly Constrained Concave Quadratic Functions and Related Problems, Ph.D. Diss., Univ. of Minnesota, Minneapolis, MN., 1984
Horst, R.: An Algorithm for Nonconvex Programming Problems, Math. Progr., Vol. 10, 1976, 312–321
Mangasarian, O. L., Meyer, R. R., and Robinson, S. M. (Eds.): Nonlinear Programming, Academic Press, New York, 1975
Fletcher, R.: Practical Methods of Optimization, Vol. 1, Unconstrained Optimization, Wiley, New York, 1980
Fletcher, R.: Practical Methods of Optimization, Vol. 2, Constrained Optimization, Wiley, New York, 1980
Poljak, B. T.: A General Method of Solving Extremum Problems, Soviet Mathematics, Vol. 8, 1967, 593–597
Duffin, R. J., Peterson, E. L., and Zener, C. M.: Geometric Programming—Theory and Application, Wiley, New York, 1968
Steihaug, T.: Quasi-Newton Methods for Large Scale Nonlinear Problems, Ph.D. Thesis, Yale Univ., New Haven, CT., 1981
Cottle, R. and Lemke, C. (Eds.): Nonlinear Programming, AMS, Providence, RI., 1976
Fonticilla, R.: A General Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization, Ph.D. Thesis, Dept. of Math Science, Rice Univ. Houston, TX., 1983
Bryoden, C. G.: A Class of Methods for Solving Nonlinear Simultaneous Equations, Math. of Comp., Vol. 19, 1965, 577–593
Goldstein, A. A. and Price, J. F.: On Descent from Local Minima, Math. of Comp., Vol. 25, 1971, 569–574
Kelley, J. E.: The Cutting Plane Method for Solving Convex Programs, SIAM J. Appl. Math., Vol. 8, 1960, 703–712
Duffin, R. J.: Linearizing Geometric Programs, SIAM Review, Vol. 12, 1970, 211–227
Rijckaert, M. J. and Walraven, E. J. C.: Reflections on Geometric Programming, in VIII.1. 1–92, 1984, 141–161
Powell, M. J. D.: Algorithms for Nonlinear Constraints that use Lagrangean Functions, Math. Progr., Vol. 14, 1978, 224–248
Avriel, M. Dembo, R. and Passy, U.: Solution of Generalized Geometric Programs, Int. J. of Num. Meth. in Eng., Vol. 9, 1975, 149–169
Rijckaert, M. J. and Debroey, V.: A Bibliographical Survey of Geometric Programming, Katholieke Universiteit Leuven, Instituut voor Chemie-Ingenieurstechniek, Report CE-RM-8205, 1983
Rijckaert, M. J. and Martens, X. M.: A Comparison of Generalized Geometr. Progr. Algorithms, J. Optim. Theory Appl., 1978, 205–242
Mc Cormick, G. P.: Nonlinear Programming, Wiley, New York, 1983
Bremmerman, H.: A Method for Unconstrained Global Optimization, Math. Biosciences, Vol. 9, 1970, 1–15
Lemarechal, C. and Mifflin, R. (Eds.): Nonsmooth Optimization, Pergamon Press, New York, 1978
Shubert, B. O.: A Sequential Method Seeking the Global Maximum of a Function, SIAM J. on Numerical Analysis, Vol. 9, 1972, 379–388
Lootsma, F. A. (Ed.): Numerical Methods of Nonlinear Optimization, Academic Press, London, 1972
Wolfe, P.: A Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions, Math. Progr., Vol. 3, 1975, 145–173
Ben-Israel, A., Ben-Tal, A., and Zlobec, S.: Optimality in Nonlinear Programming, Wiley, New York, 1981
Gill, P. E. and Murray, W.: Numerical Methods for Constrained Minimization, Academic Press, New York, 1974
Faicco, A. V.: Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press, New York, 1983
Powell, M. J. D.: A Survey of Numerical Methods for Unconstrained Optimization, SIAM Review, Vol. 12, 1970, 79–97
Davidon, W. C. Variable Metric for Minimization, A. E. C. Research and Development Report, ANL-5990, 1959
Mc Cormick. G. P.: the Projective SUMT Method for Convex Programming, Math. of Oper. Res., Vol. 14, No. 2, 1989, 203–223
Ahlfeld, D. P., Dembo, R. S., Mulvey, J. M., and Zenios, S. A.: Nonlinear Programming on Generalized Networks, ACM Trans. Math. Software, Vol. 13, 1987, 350–367
Murtagh, B. A. and Saunders, M.: Large Scale Linearly Constrained Optimization, Math. Progr., Vol. 14, 1978, 41–72
Gupta, N.: A Higher Than First Order Algor. for Nonsmooth Constr. Optimiz., Diss., Washington State Univ., Pullman, 1985
Ye, Y. and Tse, E.: An Extension of Karmarkar’s Projective Algorithm for Convex Quadratic Programming, Math. Progr., Vol. 44, 1989, 157–179
Abadie, J.: the GRG Method for Nonlinear Programming, in X-157, 1978, 335–362
Fletcher, R. and Reeves, C. M.: Function Minimization by Conjugate Gradients, Comput. J., Vol. 7, No. 2, 1964, 145–154
Boot, J. C. G.: Quadratic Programming, Algorithms—Anomalies—Applications, Rand McNally and Co., Chicago, 1964
Powell, M. J. D.: A Fast Algorithm for Nonlinearly Constrained Optimization Calculation, in VIII. 2–39, 1977
Burke, J. V. and Hann, S.-P.: A Robust Sequential Quadratic Programming Method, Math. Progr., Vol. 43, 1989, 277–303
Burke, J. V.: Methods for Solving Generalized Inequalities with Applications to Nonlinear Programming, Ph.D. Thesis, Dept. of Math., Univ. of Illinois, Urbana-Champaign, 1983
Fletcher, R. and Sainz de la Maza, E.: Nonlinear Programming and Nonsmooth Optimization by Successive Linear Programming, Math. Progr., Vol. 43, 1989, 215–256
Sainz de la Maza, E.: Nonlinear Programming Algorithms Based on LI Linear Programming and Reduced Hessian Approximations, Ph.D. Thesis, Dept. of Math. Science, Univ. of Dundee, Scotland, 1987
Dembo, R. S., Eisenstat, S. C., and Steihaug, T.: Inexact Newton Methods, SIAM J. Numer. Analysis, Vol. 19, 1982, 400–408
Dembo, R. and Steihaug, T.: Truncated Newton Methods for Large Scale Optimization, Math. Progr., Vol. 26, 1983, 190–212
Tomlin, J. A.: A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems, in VIII.1. 6–226, 1981, 359–370
Adby, P. R. and Dempster, M. A. H.: Introduction to Optimization Methods, Chapman and Hall, London, 1974
Beveridge, G. S. and Schechter, R. S.: Optimization—Theory and Practice, McGraw-Hill, New York, 1970
Aoki, M.: Intr. to Optimization Techn., Macmillan, New York, 1971
Bazaraa, M. S. and Spingarn, J.: Mathematical Programming with and without Differentiability, Georgia Inst. of Techn., School of Industrial and Systems Engineering, Atlanta, 1989
Rosen, J. B., Mangasarian, O. L., and Ritter, K. (Eds.): Nonlinear Programming, Academic Press, New York, 1970
Whittle, P.: Optimization under Constraints—Theory and Applications of Nonlinear Programming, Wiley, London, 1971
Benson, H. P.: A Finite Algorithm for Concave Minimization over a Polyhedron, Nay. Res. Logist. Quart., Vol. 32, 1985, 165–177
Chamberlain, R. M.: The Theory and Application of Variable Metric Methods to Constrained Optimization Problems, Ph.D. Diss., Univ. of Cambridge, 1980
Chamberlain, R. M.: Some Examples of Cycling in Variable Metric Algorithms for Constrained Optimization, Math. Progr., Vol. 16, 1979, 378–383
Dinkelbach, W.: On Nonlinear Fractional Programming, Management Science, Vol. 13, 1967, 492–498
Rockafellar, R. T.: Generalized Subgradients in Mathematical Programming, in VIII.1. 1–16, 1983, 368–390
Rockafellar, R. T.: The Theory of Subgradients and its Applications to Problems of Optimization—Convex and Nonconvex Functions, Heldermann-Verlag, West-Berlin, 1981
Fletcher, R.: Penalty Functions, in VIII.1. 1–16, 1983, 86–114
Zangwill, W. I.: Nonlinear Programming Via Penalty Functions, Management Science, Vol. 13, 1961, 34–358
Store, J.: Conjugate Gradient Type Methods, in VIII.1. 1–16, 1983, 540–565
Hestenes, M. R.: Conjugate Direction Methods in Optimization, Springer, Berlin, 1980
Hestenes, M. R. and Stiefel, E.: Methods of Conjugate Gradients for Solving Linear Systems, J. Res. Nat. Bureau of Standards, Vol. 49, 1952, 409–436
Poore, A. B. and Al-Hassan, Q.: The Expanded Lagrangian System for Constrained Optimization Problems, SIAM J. of Control and Optimization, Vol. 26, 1988, 417–427
Lazimy, R.: Mixed-Integer Quadratic Programming, Math. Prog., Vol. 22, 1982, 332–349
Lazimy, R.: Improved Algorithm for Mixed-Integer Quadratic Programs and a Computational Study, Math. Prog., Vol. 32, 1985, 100–113
Ferris, M. C.: Iterative Linear Programming Solution of Convex Programs, Journal of Optim. Theory and Appl., Vol. 65, No. 1, 1990, 53–65
Eaves, B. C., Gould, F. J., Peitgen, H. O., and Todd, M. J. (Eds.): Homotopy Methods and Global Convergence, Plenum Press, New York, 1983
Dorn, W. S.: Non-Linear Programming—A Survey, Mgmt. Sci., Vol. 9, 1963, 171–208
Pfranger, R.: Ein heuristisches Verfahren zur global Optimierung, Unternehmensforschung, Vol. 14, No. 1, 1970, 27–50
Yao, Y.: Dynamic Tunneling Algorithm for Global Optimization, IEEE Trans. Syst. Man and Cybern., Vol. 19, No. 5, 1989, 1222–1230
Levy, A. V. and Montalvo, A.: The Tunneling Algorithm for the Global Minimization of Functions, SIAM J. on Scientific and Statistical Comp., Vol. 6, No. 1, 1985, 15–29
Riordan, J.: An Introduction to Combinatorial Analysis, Chapman and Hall, London, 1958
Riordan, J.: Combinatorial Identities, Wiley, New York, 1968
Netto, E.: Lehrbuch der Combinatorik, Chelsea Publ. Co., New York
Klee, V.: Combinatorial Optimization—What is the State of the Art?, Math. Oper. Res., Vol. 5, No. 1, 1980
Christofides, N., Mingozzi, A., Toth, P., and Sandi, C. (Editors): Combinatorial Optimization, Wiley, N. Y., 1979
Liu, C. L.: Introduction to Combinatorial Mathematics, McGraw-Hill, New york, 1968
Held, M., Hoffman, A. J., Johnson, E.L., and Wolfe, P.: Aspects of the Traveling Salesman Problem, IBM J. of Res. and Dev., Vol. 28, No. 4, 1984, 476–486
Allison, D. C. S. and Noga, M. T.: The LI Travelling Salesman Problem, Information Processing Letters (Netherlands), Vol. 18, No. 4, 1984
Martello, S. and Toth, P.: A Mixture of Dynamic Programming and Branch and Bound for the Subset Sum Problem, Mgmt. Sci., Vol. 30, No. 6, 1984
Kozeratskaya, L. N., Lebdeva, T. T., and Sergienko, I. V.: Stability, Parametric, and Postoptimality Analysis of Discrete Optimization Problems, Cybernetics, Vol. 19, No. 4, 1983
Grötschel, M., Lovasz, L., and Schrijver, A.: The Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica, Vol. 1, No. 2, 1981
Brown, G. G. and Mc Bride, R. D.: Solving Generalized Networks, Mgmt. Sci., Vol. 30, No. 12, 1984
Picard, J.-C. and Queyranne, M.: Selected Applications of Minimum Cuts in Networks, INFOR, Vol. 20, No. 4, November 1982
Picard, J.-C. and Queyranne, M.: A Network Flow Solution to Some Nonlinear 0–1 Programming Problems With Applications to Graph Theory, Networks, Vol. 12, 1982
Gomory, R. E. and Johnson, E. L.: Some Continuous Functions Related to Corner Polyhedra, Math. Progr., Vol. 3, 1972
Ford, L. R. and Fulkerson, D. R.: Flows in Networks, Princeton Univ. Press, Princeton, N. J., 1982
Elmaghraby, S. E.: Some Network Models in Management Science, Springer-Verlag, Berlin, 1970
Lawler, E. L.: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976
Wong, R. T.: Dual Ascent Approach for Steiner Tree Problems on a Directed Graph, Math. Progr., Vol. 28, No. 3, 1984
Littger, K.: Minimierung argument-beschränkt monotoner diskreter Funktionen mittels Datenvariation, Diss., TH München, 1971
Jaeschke, G.: Kombin. dyn. Optimierung, Diss., TH Stuttgart, 1968
Baker, E. K.: Exact Algorithm for the Time-Constrained Travelling Salesman Problem, Oper. Res., Vol. 31, No. 5, 1983
Golomb, S. W. and Baumert, L. D.: Backtrack Programming, Journal of the Association for Computing Machinery, Vol. 12, No. 4, 1965
Holland, O. A.: Schnittebeneverfahren für Travelling-Salesman-und verwandte Probleme, Diss., Univ. Born, 1987
Hoffman, K. and Padberg, M.: LP-Based Combinatorial Problem Solving, Annals of Operations Research, Vol. 5, 1986, 145–194
Hu, T. C.: Combinatorial Algorithms, Addison-Wesley Publishing Company, Reading, Mass., 1982
Kohler, W. H.: Exact and Approximate Algorithms for Permutation Problems, Ph.D. Thesis, Dept. of Computer Science, Princeton Univ., 1972
Kohler, W. H. and Steiglitz, K.: Characterization and Theoretical Comparison of Branch-andBound Algorithms for Permutation Probl., J. ACM, Vol. 21, 1974, 140–156
Kohler, W. H. and Steiglitz, K.: Exact, Approximate and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/F, J. ACM, Vol. 22, 1975, 106–114
Hertz, A. and De Werre, D.: Using Tabu Search Techniques for Graph Coloring, Computing, Vol. 39, No. 4, 1987, 345–351
Leighton, F. T.: A Graph Coloring Algorithm for Large Scheduling Problems, J. of Res. of the NBS, Vol. 84, 1979, 489–503
Scarf, H. E.: Integral Polghedra in the Three Space, Mathematics of Operations Research, Vol. 10, No. 3, 1985, 403–438
Coffman, E. G. Jr., Lueker, G. S., and Rinnooy Kan, A. H. G.: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics, Mgmt. Sci., Vol. 34, No. 3, 1988, 266–290
Karmarkar, N., Karp, R. M., Lueker, G. S., and Odlyzko, A. M.: Probabilistic Analysis of Optimum Partitioning, J. Appl. Probability Vol. 23, 1986, 626–645
Padberg, M. W.: Covering, Packing and Knapsack Problems, Ann. Discr. Mathem., Vol. 5, 1979, 139–183
Korman, S. M.: Graph Colouring and Related Problems in Operations Research, Ph.D. Thesis, Imperial College, London, 1975
Weinberger, D. B.: Network Flows, Minimum Coverings, and the Four-Color Conjectures, Oper. Res., Vol. 24, No. 2, 272–290
Balas, E. and Padberg, M. W.: On the Set-Covering Problem, Operations Research, Vol. 20, No. 6, 1972, 1152–1161
Balas, E. and Padberg, M. W.: Set Partitioning—A Survey, SIAM Review, Vol. 18, 1976, 710–760
Kolesar, P. J.: A Branch-and-Bound Algorithm for the Knapsack Problem, Mgmt. Sci., Vol. 13, 1967, 723–735
Martello, S. and Toth, P.: An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm, Eur. J. Oper. Res., Vol. 1, 1977, 169–175
Salkin, H. M. and De Kluyver, C. A.: The Knapsack Problem—A Survey, Nay. Res. Logist. Quart., Vol. 22, 1975, 127–144
Suhl, U.: An Algorithm and Efficient Data Structures for the Binary Knapsack Problem, Freie Universität Berlin, Res. Report, 1977
Weingartner, H. M. and Ness, D. N.: Methods for the Solution of the Multi-Dimensional 0–1 Knapsack Problem, Oper. Res., Vol. 15, No. 1, 1967, 83–103
Nauss, R. M.: An Efficient Algorithm for the 0–1 Knapsack Problem, Mgmt. Sci., Vol. 23, 1976, 27–31
Christofides, N.: The Tray. Salesman Problem, in VIII.1. 6–05, 1979
Held, M. and Karp, R.: The Travelling Salesman Problem and Minimum Spanning Trees I, Oper. Res., Vol. 18, 1970, 1138–1162
Held, M. and Karp, R.: The Travelling Salesman Problem and Minimum Spanning Trees II, Math. Progr., Vol. 1, 1971, 6–25
Golden, B. L.: Large-Scale Vehicle Routing and Related Combinatorial Problems, Ph.D. Diss., Oper. Res. Center, M. I. T., Cambridge, Mass., 1976
Djerdjour, M., Mathur, K., and Salkin, H. M.: Surrogate Relaxation Based Algorithm for a General Quadratic Multi-Dimensional Knapsack Problem, Oper. Res. Letters, Vol. 7, No. 5, 1988, 253–258
Fleischmann, B.: Computational Experience with the Additive Algorithm of Balas, Oper. Res., Vol. 15, 1967, 153–154
Lawler, E. L. and Bell, M. D.: A Method for Solving Discrete Optimization Problems, Oper. Res., Vol. 14, No. 6, 1966, 1098–1112
Balas, E.: Discrete Programming by the Filter Method, Operations Research, Vol. 15, 1967, 915–957
Teruo, J.: Numerische Verfahren der Diskreten Optimierug, Teubner, Leipzig, 1981
Sahni, S.: General Techniques for Combinatorial Approximation, Operation Research, Vol. 25, No. 6, 1977, 920–936
Arthanari, T. S.: On Some Problems of Sequencing and Grouping, Ph.D. Thesis, Indian Statistical Institute, Calcutta, 1974
Balas, E.: Duality in Discrete Programming, II. The Quadratic Case, Mgmt. Sci., Vol. 16, No. 1, 1969, 14–32
Miller, C. E., Tucker, A. W., and Zemlin, R. A.: Integer Programming Formulation of Traveling Salesman Problems, J. ACM, Vol. 7, 1960, 326–329
Bellman, R.: Dynamic Programming Treatment of the Traveling Salesman Problem, J. ACM, Vol. 9, No. 1, 1962, 61–63
Little, J. D. C., Murty, K. G., Sweeney, D. W., and Karel, C.: An Algorithm for the Traveling Salesman Problem, Oper. Res., Vol. 11, No. 6, 1963, 972–989
Bellman, R. and Hall, M., Jr. (Eds.): Combinatorial Analysis, Proc. of the Tenth Symposium in Applied Mathematics of the AMS, 1960
Markowitz, H. M. and Manne, A. S.: On the Solution of Discrete Progr. Problems, Econometrica, Vol. 25, 1957, 84–110
Svestka, J. A. and Huckfeldt, V. E.: Computational Experience with m-salesman Traveling Salesman Algorithm, Mgmt. Sci., Vol. 19, 1973, 790–799
Gavish, B.: A Note on `The Formulation of the m-salesman Traveling Salesman Problem’, Mgmt. Sci., Vol. 22, 1976, 704–705
Svestka, J. A.: Response to `A Note on the Formulation of the m-salesman Traveling Salesman Problem’, Vol. 22, 1976, 706
Arthur, J. L. and Frendewey, J. O.: Generating Traveling Salesman Problems with Known Optimal Tours, J. Oper. Res., Soc., Vol. 39, No. 2, 1988, 785–795
Eiselt, H. A. and Laporte, G.: Combinatorial Optimization Problems with Soft and Hard Requirements, J. Oper. Res. Soc., Vol. 38, No. 9, 1987, 785–795
Gilmore, P. C. and Gomory, R. E.: The Theory and Computation of Knapsack Functions, Oper. Res., Vol. 14, No. 6, 1966
Johnson, D. S.: Fast Algorithms for Bin Packing, Journal Comp. Systems Sci., Vol. 8, 1974, 272
Granot, F. and Hammer, P. L.: On the Use of Boolean Functions in 0–1 Programming, Methods of Oper. Res., Vol. 12, 1972, 154–184
Granot, F. and Hammer, P. L.: On the Role of Generalized Covering Problems, Cahiers du Center d’Etudes de Recherche Operationelle, Vol. 16, 1974, 277–289
Maffioli, F.: The Complexity of Combinatorial Optimization Algorithms and the Challenge of Heuristics, in VIII.1. 6–05, 1979
Edmonds, J.: Paths, Trees and Flowers, Canad. J. Math., Vol. 17, 1965, 449–467
Edmonds, J. and Karp, R. M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Probl., J. ACM, Vol. 19, 1972, 248–264
Preparata, F. P. and Hong, S. J.: Convex Hulls of Finite Sets of Points in Two a. Three Dimensions, Comm. of the ACM, Vol. 20, 1977, 87–93
Kruskal, J. B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. AMS, Vol. 7, 1956, 48–50
Guy, R. et al. (Ed.): Combinatorial Structures and Their Application, Programming of the Calgary Intern. Conference, Gordon and Breach, New York, 1970
Rinaldi, S. (Ed.): Combinatorial Optimiz., Springer, Berlin, 1973
Karp, R. M.: On the Computational Complexity of Combinatorial Problems, Networks, Vol. 5, No. 1, 1975, 45–68
Leue, O.: Methoden zur Lösung dreidimensionaler Zuordnungsprobleme, Forschungsbericht Nr. 9, Lehrstuhl für Betriebswirtschaftslehre I, TH Darmstadt, 1971
Junginger, W.: über die Lösung des dreidimensionalen Transportproblems, Uinversität Stuttgart, Diss., August 1970
Norback, J. P. and Love, R. F.: Geometric Approaches to Solving the Travelling Salesman Problem, Mgmt. Sci., Vol. 23, No. 11, 1977, 1208–1223
Gerhardt, C.: Gedanken zur Lösung des Knapsackproblems, Ablauf-und Planungsforschung, Vol. 11, No. 2, 1970, 69–83
Croes, G. A.: A Method for Solving Traveling Salesman Problems, Oper. Res., Vol. 6, 1958, 791–812
Flood, M. M.: The Tray. Salesman Probl., Oper. Res., Vol. 4, 1956, 61
Balinski, M. L.: An Algorithm for Finding all Vertices of Convex Polyhedral Sets, SIAM J., Vol. 9, No. 1, 1961, 72–88
Fiorot, J. Ch.: Generation of all Integer Points for Given Sets Linear Inequalities, Univ. of Lille, France, Laboratorie de Calcul de la Faculte des Science, October 1970
Veinott, A. F. Jr. and Dantzig, G. B.: Integral Extreme Points, SIAM Review, Vol. 10, No. 3, 1968, 371–372
Hoffman, A. J. and Kruskal, J. B.: Integral Boundary Points of Convex Polyhedra, in VIII.1. 2–30, 1956, 233–246
Padberg, M. and Rinaldi, G.: Optimization of 532-City Symmetric Travelling Salesman Problem by Branch and Cut, Oper. Res. Letters, Vol. 6, 1987, 1–7
Lin, S. and Kernighan, B.: An Effective Heuristic Algorithm for the Traveling Salesman Problem, Oper. Res., Vol. 21, 1973, 498–516
Muehlenbien, H., Gorges-Schleuter, M., and Kraemer, O.: Evolution Alg. in Combin. Optimiz., Parallel Comp., Vol. 7, 1988, 65–85
Rossier, Y., Troyon, M. and Liebling, Th. M.: Probabilistic Exchange Algorithms and Euclidean Traveling Salesman Problems, OR Spektrum, Vol. 8, 1986, 151–164
Dueck, G. and Scheuer, T.: Threshold Accepting—A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing, IBM Germany, Heidelberg Sci. Center, Rept. TR 88.10. 011, Oct. 1988
Weber, M. and Liebling, Th. M.: Euclidean Matching Problems and the Metropolis Algorithm, Zeitschr. für Oper. Res., Vol. 30, 1986, A85–A110
Iri, M., Marota, K. and Matsui, S.: Heuristics for Planar Minimum-Weight Perfect Matchings, Networks, Vol. 13, 1983, 67–92
Silverman, R. D.: The Multiple Polynomial Quadratic Sieve, Math. Comp., Vol. 48, No. 177, Jan. 1987
Wong, R. T.: Integer Programming Formulations for the Traveling Salesman Problem, Proc. IEEE Int. Conf. of Circuits and Computers, 1980, 149–152
Claus, A.: A New Formulation for the Traveling Salesman Problem, SIAM J. Alg. Disc. Meth., Vol. 5, 1984, 21–25
Martello, S.: An Enumerative Algorithm for Finding Hamiltonian Circuits in Directed Graph, ACM Trans. on Math. Softw., Vol. 9, 1983, 131–138
Balas, E. and Christofides, N.: A Restricted Lagrangean Approach to the Tray. Salesman Problem, Math. Progr., Vol. 21, 1981, 19–46
Parker, R. G. and Rardin, R. L.: The Traveling Salesman Problem—An Update of Res., Nay. Res. Logist. Quart., Vol. 30, 1983, 69–96
Finke, G.: Bulk Shipment Formulation for the Traveling Salesman Problem, Methods of Oper. Res., Vol. 5, 1984, 247–256
Finke, G., Clause, A. and Gunn, E.: A Two-Commodity Network Flow Approach to the Traveling Salesman Problem, Congressus Numerantium, Vol. 41, 1984, 167–178
Aris, R.: Discrete Dynamic Programming, Blaisdell Publ. Comp., New York, 1963
Balas, E.: Discrete Programming by Implicit Enumeration, Springer, Berlin, 1967
Balas, E.: Intersection Cuts from Maximal Convex Extensions of the Ball and the Octahedron, Carnegie-Mellon-Univ., Graduate School of Industrial Admin., Pittsburg, Pennsylvania, 1970
Balinski, M. L. and Norman, M.: Experiments with Set Covering Problems, Mathematica Working Paper, January 1985
Barachet, I. T.: Graphic Solution of the Traveling Salesman Problem, Operations Research, Vol. 5, No. 6, 1957
Müller-Merbach, H.: Drei Neue Methoden zur Lösung des Traveling Salesman Problems, Ablauf-und Planunsgforschung, Vol. 7, 1966, 32–46 und 78–91
Müller-Merbach, H.: Ermittlung des kuerzesten Rundreiseweges mittels linearer Programmierung, Ablauf-und Planungsforschung, Vol. 2, No. 5, 1961, 70–83
Beckenbach, E. F. (Ed.): Applied Combinatorial Mathematics, Wiley, New York, 1964
Bellmore, M. and Nemhauser, G. L.: The Traveling Salesman Problem—a Survey, Operations Research, Vol. 16, 1968, 538–558
Bellmore, M. and Malone, J. C.: Pathology of Traveling Salesman Algorithms, The John Hopkins Univ., Technical Report
Bellmore, M. and Ratliff, H. D.: Set Covering and Involutory Bases, The John Hopkins Univ., Technical Report, 1970
Benders, J. F., Catchpole, A. R., and Kuiken, C.: Discrete Variables Optimization Problems, The RAND-Symposium on Math. Progr., 1959
Ben-Israel, A. and Charnes, A.: On Some Probl. of Dioph. Progr., Cahiers Center Etudes Recherche Oper., Vol. 4, 1962, 215–280
Gelfand, S. I., Gerver, M. L., and Kirillov, A. A.: Sequences and Combinatorial Problems, Gordon and Breach, New York, 1969
Iri, M.: Network Flow, Transportation and Scheduling, Theory and Algorithms, Academic Press, New York, 1969
Kaufmann, A.: Introduction a la combinatorique en vue des applications, Dunod, Paris, 1968
Grötschel, M. und Padberg, M. W.: Lineare Charakterisierungen von Travelling Salesman Problemen, Zeitschr. für Oper. Res., Vol. 21, 1977, 33–64
Grötschel, M.: Beiträge zur polyedrischen Beschreibung kombinatorischer Optimierungsprobleme, Diss., Bonn, 1977
Dantzig, G. B., Fulkerson, R., and Johnson, S.: Solution of a Large Scale Tray.-Salesman Problem, Oper. Res., Vol. 2, 1954, 393–410
Padberg, M. W.: On the Facial Structure of Set Packing Polyhedra, Math. Progr., Vol. 5, 1973, 119–215
Padberg, M. W. and Rao, R. M.: The Tarv. Salesman Problem and a Class of Polyhedra of Diameter Two, Math. Progr., Vol. 7, 1974, 32–45
Wolsey, L. A.: Faces for Linear Inequalities in 0–1 Variables, Math. Progr., Vol. 8, 1975, 165–178
Padberg, M. W.: A Note on Zero-One Programming, Operations Research, Vol. 23, 1975, 833–837
Hong, S.: A Linear Programming Approach for the Tray.-Salesman Problem, Ph.D. Thesis, The John-Hopkins Univ., Baltimore, 1971
Balas, E.: Facets of the Knapsack Polytope, Mathematical Programming, Vol. 8, 1975, 146–164
Beale, E. M. L. and Tomlin, J. A.: An Integer Programming Approach to a Class of Combin. Problems, Math. Progr., Vol. 3, 1972, 339–344
Dueck, W.: Diskrete Optimierung, Vieweg, Braunschweig, 1977
Lin, S.: Computer Solutions of the Traveling Salesman Problem, Bell System Techn. Journal, Vol. 44, 1965, 2245–2269
Kuhn, H. W.: The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly, Vol. 2, 1955, 83–97
Korbut, A. A. and Finkelstein, J. J.: Diskrete Optimierung, Akademie Verlag, Berlin, 1971
Burckhardt, W.: Zur Optimierung von räumlichen Zuordnungen, Ablauf und Planungsfoschung, Vol. 10, 1969, 233–248
Schoch, M.: Ein Eweiterungsprinzip als Konzeption zur Lösung kombinatorische Optimierungsprobleme, Math. Operationsforschung und Statistik, Vol. 1, 1970, 265–280
Bradley, G. H.: Transformation of Integer Programs to Knapsack Problems, Discrete Mathematics, Vol. 1, 1971, 29–45
Burkard, R. E. and Stratmann, K. H.: Numerical Investigations on Quadratic Assignment Problems, Nay. Res. Logist. Quart., Vol. 25, 1979, 129–144
Wilhelm, M. R. and Ward, T. L.: Solving Quadratic Assignment Problems by Simulated Annealing, IIE Trans, Vol. 19, No. 1, 1979, 107–119
Lawler, E. L.: The Quadratic Assignment Problem, Mgmt. Sci., Vol. 9, 1963
Lawler, E. L.: The Quadratic Assignment Problem—A Brief Review, Paper Presented at an Advanced Study Institute on Combinatorial Programming, Versailles, France, September 1974
Padberg, M. W.: Perfect Zero-One Matrices, Math. Progr., Vol. 6, 1974, 180–196
König, D.: Theorie der endlichen und unendlichen Graphen, Akad. Verl. Ges., Leipzig, 1936 und Chelsea, New York, 1964
Guignard, M. and Spielberg, K.: Mixed-Integer Algorithm for the (0,1)-Knapsack Problem, IBM Journal of Research and Development, Vol. 16, No. 4, 1972, 424–430
Kuhn, H. W.: Variants of the Hungarian Method for Assignment Problems, Nay. Res. Logist. Quart., Vol. 3, 1956, 253–258
Egervary, J.: On Combinatorial Properties of Matrices (in Hungarian), Matematikai es Fizikai Lapok 38, 1931, 16–28
Egervary, J.: Combinatorial Methods for Solving Transportation Problems, Mag. Tud. Akad. Mat. Kut. Intez. Koezlemenley, Vol. 4, 1959, 15–28
Padberg, M. W.: Total Unimodularity and the Euler-Subgraph Problem, Oper. Res. Letters, Vol. 7, No. 4, 1988, 173–179
Fischetti, M. and Toth, P.: New Dominance Procedure for Combinatorial Optimization Problems, Oper. Res. Letters, Vol. 7, No. 4, 1988, 181–187
Jonker, R. and Volgenant, T.: Improved Transformation of the Symmetric Multiple Traveling Salesman Problem, Oper. Res., Vol. 36, No. 1, 1988, 163–167
Gal, T. und Kruse, H.-J.: Ein Verfahren zur Lösung des Nachbarschaftsproblems, in VIII.1. 1–57, 1985, 447–454
Kruse, H.-J.: Entartungsgraphen und ihre Anwendung zur Lösung des Nachbarschatsproblems, Diss., Fachbereich Wirtschaftswissenschaft, Fernuniversität Hagen, 1984
Kruse, H.-J.: Kritische Betrachtungen an einem Verfahren zur Bestimmung aller Nachbarn einer entarteten Ecke einer konvexen polyedrischen Menge, Fachbereiche Wirtschaftswissenschaft, Fernuniversität Hagen, 1980
Gal, T.: On the Structure of the Set Bases of a Degenerate Point, Journal Opt. Theory and Appl., Vol. 45, No. 4, 1985
Gal. T.: Determination of All Neighbors of a Degenerate Extreme Point in Polytopes, Disc. Paper No. 17b, Fachbereich Wirtschaftswissenschaft, Fernuniversität Hagen, 1978
Fleischmann, B.: A New Class of Cutting Planes for the Symmetric Tray. Salesm. Probl., Math. Progr., Vol. 40, No. 3, 1988, 225–246
Burkard, R. E. and Derigs, U.: Assignment and Matching Problems—Solution Methods with FORTRAN-Programs, Springer, Berlin, 1980
Efron, B.: The Convex Hull of a Random Set of Points, Biometrica, Vol. 52, No. 3, 1965, 331–345
Carnal, H.: Die konvex Huelle von n rotationssymmetrisch verteilten Punkten, Zeithschr. für Wahrscheinlichkeitsrechnung und verwandte Gebiete, Vol. 15, 1970, 168–176
Kelly, D. G. and Tolle, J. W.: Expected Number of Vertices of a Random Convex Polytope, Univ. of North Carolina, Chapel Hill, 1979
Raynaud, H.: Sur l’enveloppe convexe des nuages de points aleatoires dans Rn, Journal of Appl. Probab., Vol. 7, 1970, 35–48
Renyi, A. und Sulanke, R.: Über die konexe Huelle von n zufällig gewählten Punkten I, Zeitschr. für Wahrscheinlichkeitsrechnung und verw. Gebiete, Vol. 2, 1963, 75–84
Renyi, A. und Sulanke, R.: Über die konexe Huelle von n zufällig gewählten Punkten I, Zeitschr. für Wahrscheinlichkeitsrechnung und verw. Gebiete, Vol. 3, 1964, 138–147
May, J. H. and Smith, R. L.: Random Polytopes-Their Definition, Generation and Aggregate Properties, Math. Progr., Vol. 24, 1982, 39–54
Korte, D. und Oberhofer, W.: Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblemes, Unternehmensforschung, Vol. 12, Heft 4, 1968, 217–231
Greenberg, H. and Hegerick, R. L.: A Branch Search Algorithm for the Knapsack Problem, Mgmt. Sci., Vol. 16, No. 5, 1970, 327–332
Ross, G. T. and Soland, R. M.: A Branch-and-Bound Algorithm for the Generalized Assignment Probl., Math. Progr., Vol. 8, 1975, 91–103
Padberg, M. and Sung, T.-Y.: Polynomial-Time Solution to Papadimitrious and Steiglitz’s `Traps’, Oper. Res. Letters, Vol. 7, No. 3, 1988, 117–125
Roy, B. (Ed.): Combinatorial Programming-Methods and Applications, Proc. of the NATO Adv. Study Institute, Versailles, Sept. 2–13, 1974, D. Reidel, Boston, 1975
Guignard, M. and Kim, S.: Lagrangean Decomposition-A Model Yielding Stronger Bounds, Math. Progr., Vol. 39, No. 2, 1987, 215–228
Roucairol, C.: Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem, Discrete Appl. Math., Vol. 18, No. 2, 1987, 211–228
Christofides, N.: Bounds for the Travelling-Salesman Problem, Oper. Res., Vol. 20, No. 5, 1972, 1044–1056
Christofides, N.: An Algorithm for the Chromatic Number of a Graph, The Computer J., Vol. 14, No. 1, 1971, 38–39
Papadimitriou, C. H. and Steiglitz, K.: Combinatorial Optimization-Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, N. J., 1982
Martello, S. and Toth, P.: Algorithms for Knopsack Problems, Annals of Discrete Mathematics, Vol. 31, 1987, 213–257
Camion, P.: Characterization of Totally Unimodular Matrices, Proc. Am. Math. Soc., Vol. 16, 1965, 1068–1073
Ghouila-Houri, A.: Characterisation des matrices totallement unimodularies, C. R. Acad. Sc. Paris, Vol. 254, 1962, 1192–1194
Gondran, M.: Matrices totallement unimodulaires, E. D. F. Bulletin, Series C, Vol. 1, 1973, 5574
Balas, E.: On the Convex Hull of the Union of Certian Polyhedra, Oper. Res. Letters, Vol. 7, No. 6, 1988, 279–283
Golden, B., Bodin, L., Doyle, T., and Stewart, W. Jr.: Approximate Travelling Salesman Problem in the Plane, Oper. Res., Vol. 28, No. 3, Part 2, 1980, 694–711
Horowitz, E. and Sahni, S.: Computing Partitions with Applications to the Knapsack Problem, J. ACM, Vol. 21, 1974, 277–292
Fleishman, S. B.: Efficient Application of Noserial Dynamic Programming in Combinatorial Optimization, Autom. Remote Control, Vol. 49, No. 2, part 1, July 10, 1988, 184–193
Cornuejols, G. and Sassano, A.: On the 0, 1 Facets of the Set Covering Polytope, Math. Progr. Ser. A, Vol. 43, No. 1, 1989, 45–55
Balas, E. and Ng, S. M.: On the Set Covering Polytope I-All the Facets With Coefficients in (0,1,2), Math. Progr., Ser. A, Vol. 43, No. 1, Jan. 1989, 57–69
Edmonds, J.: Optimum Branchings, J. Res. Natl. bur. Stand. Math. Mathem. Phys., No. 71B, 1967, 233–240
Fisher, M. L., Jaikumar, R., and Van Wassenhove, L.: A Multiplier Adjustment Method for the Generalized Assignment Problem, Mgmt. Sic., Vol. 9, 1986, 1095–1103
Shapiro, J. F.: A Survey of Lagrangean Techniques for Discrete Optimization, Ann. Discrete Math., Vol. 5, 113–138, 1979
Held, M., Wolfe, P., and Crowder, H. D.: Validation of Subgradient Optimization, Math. Progr., Vol. 6, 1974, 62–88
Sandi, C.: Subgradient Optimization, in VIII.1. 6–05, 1979, 73–91
Martello, S. and Toth, P.: Linear Assignment Problems, Ann. Discrete Mathematics, Vol. 31, 1987, 259–282
Young, H. P.: On Permutations and Permutation Polytopes, Mathematical Programming Studies, No. 8, 1978, 128–140
Weyl, H.: Elementare Theorie der konvexen Polyeder, Comm. Math. Helv., Vol. 7, 1935, 290–306
Hammer, P. L., Johnson, E. L., and Peled, U.N.: Faces of Regular 0–1 Polytopes, Math. Progr., Vol. 8, 1975, 179–206
Gavish, B. and Srikanth, K.: An Optimal Solution for Large-Scale Multiple Travelling Salesmen Problems, Oper. Res., Vol. 34, 1987, 698–717
Burkard, R. E.: Traveling Salesman and Assignment Problems—A Survey, Annals of Discrete Math., No. 4, 1979, 193–215
Jeromin, B. and Körner, F.; Triangle Inequality and Symmetry in Connection with the Assignment and the Traveling Salesman Probl., Eur. J. Oper. Res., Vol. 38, No. 1, 1989, 70–75
Volgenant, A.: Contributions to the Solution of the Traveling Salesman Problem and Related Problems, Diss., Amsterdam, 1987
Korte, B.: Approximative Algorithms for Discrete Optimization Problems, Annals of Discrete Math., No. 4, 1979, 85–120
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. (Eds.): The Travelling Salesman Problem—A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985
Jeroslow, R. G.: A Simplification for Some Disjunctive Formulations, Georgia Institute of Technology, December 1985
Papadimitriou, C. H. and Steiglitz, K.: Some Examples of Difficult Traveling Salesman Problems, Oper. Res., Vol. 26, 1978, 434–441
Escudero, L. F.: In exact Algorithm for the Sequential Ordering Problem, Eur. J. Oper. Res., Vol. 37, No. 2, 1988, 236–248
Thompson, G. L. and Karp, R. L.: A Heuristic Approach to Solving Traveling Salesman Problems, Mgmt. Sci., Vol. 10, 1964, 225–247
Crowder, H. and Padberg, M. W.: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality, Mgmt. Sci., Vol. 26, 1980, 495–509
Livshits, E. M.; A Study of Some Algorithms of Discrete Optimization, Ph.D. Thesis, Kharkov, 1969
Brezovec, C., Cornuejols, G., and Glover, F.: Matriod Algorithm and Problems of Graphs, Math. Progr., Ser. B., Vol. 42, No. 3, 1988, 471–487
Papadimitriou, C.H.: The Complexity of Combinatorial Optimization Problems, Ph.D. Thesis, Princeton Univ., 1976
Padberg, M. W.: A Note on the Total Unimodularity of Matrices, Discrete Mathematics, Vol. 14, No. 3, 1976, 273–278
Saaty, T. L.: The Number of Vertices of a Polyhedron, American Mathematics Monthly, Vol. 65, 1955, 327–331
Karp, R. M. and Papadimitriou, C. H.; On Linear Characterizations of Combinatorial Optimization Problems, SIAM J. on Computing, Vol. 11, 1982, 620–632
Grötschel, M. and Wakabayashi, Y.: Cutting Plane Technique for a Clustering Problem, Math. Progr., Ser. B., Vol. 45, No. 1, 1989, 59–96
Balas, E. and Ng, S. M.: On the Set Covering Polytope II—Lifting the Facets With Coefficients in (0,1,2), Math. Progr., Ser. B, Vol. 45, No. 1, 1989, 1–20
Edmonds, J.: Maximum Matching and a Polyhedron with 0,1 Vertices, J, Res. NBS, Vol. 69B, 1965, 125–130
Ivanov, N. N.: Integral Points of Convex Polyhedral Sets, Doctoral Diss., Minsk, 1976
Meyer, R. R. and wage, M. L.: On the Polyhedrality of the Convex Hull of the Feasible Set on an Integer Program, SIAM J. Control and Optim., Vol. 16, No. 4, 1978, 682–687
Rustin, B. (Ed.): Combinatorial Algorithms, Academic Press, New York, 1973
Schrijver, A.: On Cutting Planes, Annals Discrete Math., Vol. 9, 1980, 291–296
Kern, W.: Verfahern der kombinatorischen Optimierung und ihr Gültigkeitsbereich, Techn. Univers. Twente, Enschede (Netherlands ), 1989
Culioli, J.-C., Glover, C. W., Jones, J. P., and Roe, C.: Implementation of Some Heuristics and an Optimal Algorithm for Large Scale Assignment Problems, Oak Ridge National Lab., Tennessee, 1989
Barahona, F. and Mahjoub, A. R.: On the Cut Polytope, Mathematical Programming, Vol. 36, No. 1, 1986, 157–173
Grötschel, M., Jünger, M., and Reinelt, G.: A Cutting Plane Algor. for the Lin. Ordering Problem, Oper. Res., Vol. 32, 1984, 1195–1220
Edmonds, J.: Submodular Functions, Matroids and Certain Polyhedra, in VIII.1. 6–77, 1970, 69–87
Grötschel, M. and Holland, O. A.: Solving Matching Problems with Linear Programming, Math. Progr., Vol. 33, 1985, 243–259
Wakabayashi, Y.: Aggregation of Binary Relations—Algorithmic and Polyhedral Investigations, Ph.D. Thesis, Univ. Augsburg, 1986
Balas, E.: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, SIAM J. on Algebraic and Discrete Methods, Vol. 6, 1985, 466–486
Hansen, P. (Ed.): Studies on Graphs and Discrete Programming, North-Holland, Amsterdam, 1981
Giles, F. R. and Pulleyblank, W. R.: Total Dual Integrality and Integer Polyhedra, Linear Algebra and its Applications, Vol. 25, 1979, 191–196
Frank, A. and Tardos, E.: Generalized Polymatroids and Submodular Flows, Math. Progr., Ser. B., Vol. 42, No. 3, 1988, 489–563
Pulleyblank, W. R.: Polyhedral Combinatorics, in VIII.1. 1–16, 1983, 312–345
Pulleyblank, W. R. (Ed.): Progress in Combinatorial Optimization, Academic Press, Toronto, 1984
Edmonds, J.: Matroids and the Greedy Algorithm, Math. Progr., Vol. 1, 1971, 127–136
Edmonds, J.: Matroid Intersection, Annals of Discrete Mathematics, Vol. 4, 1979, 39–49
Yemelichev, V. A., Kovalev, M. M., and Kravtscv, M. K.: Polytopes, Graphs a. Optimiz., Cambridge Univ. Press, Cambridge, U.K., 1984
Cunningham, W. H.: An Unbounded Matroid Intersection Polyhedron, Linear Algebra and its Applications, Vol. 16, 1977, 209–215
Recski, A. and Lovasz, L. (Ed.): Matroid Theory, North-Holland, Amsterdam, 1985
Lovasz, L.: A Generalization of König’s Theorem, Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 21, 1970, 443–446
Giles, R.: Submodular Functions, Graphs and Integer Polyhedra, Ph.D. Thesis, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Canada, 1975
Tutte, W. T. (Ed.): Recent Progress in Combinatorics, Proceedings of the Third Waterloo Conference on Combinatorics, May 1968, Academic Press, New York, 1969
Grötschel, M.: Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme, Hain, Meisenheim, 1977
Rado, R.: A Theorem on Independence Functions, Quarterly Journal of Mathematics, Oxford, VOL. 13, 1942, 83–89
Rado, R.: Note on Independence Functions, Proceedings of the London Mathematical Society, Third Series, Vol. 7, 1957, 300–320
Edmonds, J. and Giles, R.: A Min-Max Relation for Submodular Functions on Graphs, Annals of Discrete Math., Vol. 1, 1977, 185–204
Cunningham, W. H. and Frank, A.: A Primal-Dual Algorithm for Submodular Flows, Math. of Oper. Res., Vol. 10, 1985, 251–262
Dunstan, F. D. J.: Matroids and Submodular Functions, Quarterly J. of Mathematics, Oxford, Vol. 27, 1976, 339–347
Sahni, S.: Approximate Algorithms for the 0/1-Knapsack Problem, J. of the ACM, Vol. 22, 1975, 115–124
Schirjver, A.; Polyhedral Proof Methods in Combinatorial Optimization, Discrete Applied Math., Vol. 14, 1986, 111–133
Seymour, P. D.; Decomposition of Regular Matroids, J. Combin. Theory, Ser. B., Vol. 28, 1980, 305–359
Grout, V. M., Sanders, P. W., Stockel, C. T.: Reduction Techinques Providing Initial Groupings for Euclidean Tray. Salesman Patching Algorithms, Appl. Math. Modelling, Vol. 13, 1989, 110–114
König, D.: Graphen and ihre Anwendung auf Determinatentheorie and Mengenlehre, Math. Ann., Vol. 77, 1916, 453–465
Teruo, J.: Grundprinzipien der diskreten Optimierung, Diss., TU Dresden, 1977
Whitney, H.: On the Abstract Properties of Linear Dependence, Amer. J. Math., Vol. 57, 1935, 509–533
Wilson, R. J.: An Introduction into Matroid Theory, American Math. Monthly, Vol. 80, 1973, 500–525
Rado, R.: Theorems on Linear Combinatorial Topology and General Measure, Annals of Mathematics, Vol. 44, 1943, 228–270
Lovasz, L.: Submodular Functions and Convexity, in VIII.1. 1–16, 1983, 235–257
Kerber, A. (Ed.): Diskrete Strukturen, algebraische Methoden and Anwendungen, Tagungsbericht 2. Sommerschule Diskrete Strukturen, Bayreuth, 1985, Bayreuther Math. Schriften, Heft 21, 1986
Matheiss, T. H. and Rubin, D. S.: Survey and Comparison of Methods for Finding all Vertices of a Convex Polyhedral Set, Math. of Oper. Res., Vol. 5, 1980, 167–185
Khang, D. B. and Fujiwara, O.: A New Algorithm to Find all Vertices of a Polytope, Oper. Res. Letters, Vol. 8, 1989, 261–264
Pulleybank, W. R.: Faces of Matching Polyhedra, Ph.D. Thesis, Univ. of Waterloo, Canada, 1973
Lovasz, L. and Plummer, M. D.: Matching Theory, Ann. Discrete Math. No. 29, North-Holland, Amsterdam, 1986
Recski, A.: Matroid Theory and its Appl., Springer, Berlin, 1987
Syslo, M. M., Deo, N., and Kowalik, J. S.: Discrete Optimization Algorithms, Prentice-Hall, Englewood Cliffs, N. J., 1983
Zimmermann, U.: Linear and Combinatorial Optimization in Ordered Algebraic Structures, Ann. Discr. Math., No. 10, North-Holland, Amsterdam, 1981
Prim, R. C.: Shortest Connection Networks and Some Generalizations, Bell Syst. Tech. J., Vol. 36, 1957, p. 1389
Fishburn, P. C.: Combinatorial Optimization Problems for Systems of Subsets, SIAM Review, Vol. 30, No. 4, 1988, 578–588
Schrijver, A.: Min-Max Results in Combinatorial Optimization, in VIII.1. 1–16, 1983, 438–500
Hu, T. C.: Multicommodity Networks Flows, Oper. Res., Vol. 11, 1963, 344–360
Marsh, A. B.: Matching Algorithms, Ph.D. Thesis, John Hopkins University, Baltimore, 1979
Frobenius, G.: Über Matrizen aus nichtnegativen Elementen, Sitzber. der Preuss. Akad. Wiss., 1912, 456–477
Frobenius, G.: Über zerlegbare Determinanten, Sitzber. der Preuss. Akad. Wiss., 1917, 274–277
Langevin, A., Soumis, F., and Desrosiers, J.: Classification of Tray. Salesman Problem Formulations, Vol. 9, No. 2, 1990, 127–132
Berge, C.: Optimization and Hypergraph Theory, Europ. J. Oper. Res., Vol. 46, No. 3, 1990, 297–303
Dyckhoff, H.: A Typology of Cutting and Packing Problems, Europ. J. Oper. Res., Vol. 44, No. 2, 1990, 145–159
Reingold, E. M., Nievergelt, J., and Deo, N.: Combinatorial Optimization—Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey, 1977
Gomory, R. E.: Some Polyhedra Related to Combinatorial Problems, Linear Algebra and Appl., Vol. 2, 1969, 451–558
Raghavachari, M.: A Constructive Method to Recognize the Total Unimodularity of a Matrix, Zeitschr. für Oper. Res., Vol. 20, No. 1, 1976, 59–61
Guignard, M. and Roseenwein, M. B.: Application-oriented Guide for Designing Lagrangean Dual Ascent Algorithms, Eur. J. Oper. Res., Vol. 43, No. 2, 197–205
Glover, F. and Wolsey, B.: Aggregating Diophantine Equations, J. Oper. Res., Vol. 16, No. 1, 1972
Hoffman, A. J.: Total Unimodularity and Combinatorial Theorems, Linear Algebra and Applications, Vol. 13, 1976, 103–108
Cramer, Y., Hammer, P. L., and Ibaraki, T.: Strong Unimodularity for Matrices and Hypergraphs, Discrete Appl. Math., Vol. 15, 1986, 221–239
Jeroslow, R.: The Theory of Cutting-Planes, in VIII.1.1. 6–05, 1979, 21–72
Bellman, R.: Dynamic Programming, Princeton Univ. Press, Princeton, N. J., 1957
Bellman, R. and Dreyfus, S.: Applied Dynamic Programming, Princeton Univ. Press, Princeton, New Jersey, 1962
Hadley, G.: Nonlinear and Dynamic Programming, Addison-Wesley Publishing Company, Reading, Mass., 1964
Bellman, R. E. and Lee, E. S.: History and Development of Dynamic Programming, IEEE Control Syst. Mag., Vol. 4, No. 4, 1984
Schneeweiss, Ch.: Dynamisches Progr., Physica, Würzburg, 1974
Morin, T. L. and Marsten, R. E.: Branch-and-Bound Strategies for Dynamic Programming, Oper. Res., Vol. 24, No. 4, 1976, 611–627
Karp, R. M. and Held, M.: Finite-State Processes and Dynamic Programming, SIAM J. of Appl. Math. Vol. 15, No. 3, 1967, 693–718
Held, M. and Karp, R. M.: A Dynamic Programming Approach to Sequencing Problems, SIAM J. of Appl. Math., Vol. 10, 1962
Kaufmann, A. and Cruon, R.: Dynamic Programming, Sequential Scientific Management, New York, 1967
Wong, P. J.: A New Decomposition Procedure for Dynamic Programming, Oper. Res., Vol. 18, No. 1, 1970, 119–131
Wong, P. J. and Luenberger, D. G.: Reducing the Memory Requirements of Dynamic Progr., Oper. Res., Vol. 16, 1968, 1115–1125
Neumann, K.: Zur Theorie der Dynamischen Optimierung, Teil I und Teil II, Unternehmensforschung, Vol. 9, No. 3, und No. 4, 1965, 169–186 und 201–216
Bellman, R.: Dynamic Programming Treatment of the Traveling Salesman Problem, J. ACM, Vol. 9, 1962, 61–63
Karp, R. M. and Held, M.: Finite-State Processes and Dynamic Programming, SIAM J. Appl. Math. Vol. 15, No. 3, 1967, 693–718
Nemhauser, L.: Introduction to Dynamic Progr., Wiley, New York, 1966
Denardo, E. V.: Sequential Decision Processes, Doctoral Thesis, Northwestern Univ., Evanston, Illinosis, 1965
Angel, E. and Bellman, R.: Dynamic Programming and Partial Differential Equations, Academic Press, New York, 1972
Aris, R.: Discrete Dynamic Programming, Blaisdell Publ. Comp., New York, 1963
Beckmann, M. J.: Dynamic Programming of Ecomonic Decisions, Springer, Berlin, 1968
Bellman, R. and Gross, O.: Some Combinatorial Problems Arising in the Theory of Multi Stage Processes, J. SIAM, Vol. 2, No. 3, 1954
Ibaraki, T.: Solvable Classes of Discrete Dynamic Programming, J. Math. Anal. Appl., Vol. 43, 1973, 642–693
Ibaraki, T.: On the Optimality of Algorithms for Finite State Sequential Decision Processes, J. Math. Anal. Appl., Vol. 53, 1976, 618–643
Rosenthal, A.: Dynamic Programming is Optimal for Certain Sequential Decision Processes, J. Math. Anal. Appt, Vol. 73, 1980, 134–137
Rosenthal, A.: Dynamic Progr. is Optimal for Nonserial Optimization Problems, SIAM J. Comput., Vol. 11, 1982, 47–59, 1980, 134–137
Heiman, P.: A Common Schema for Dynamic Programming and Branch and Bound Algorithms, J. ACM, Vol. 36, No. 1, 1989, 97–128
Heiman, P. and Rosenthal, A.: A Comprehensive Model of Dynamic Programming, SIAM J. on Algebraic and Discrete Methods, Vol. 6, 1985, 319–334
Helman, P.: The Principle of Optimality in the Design of Efficient Algorithms, J. Math. Anal. Appl., Vol. 119, 1986, 97–127
Sniedovich, M.: A New Look at Bellman’s Principle of Optimality, J. Optim. Theory and Appl., Vol. 49, No. 1, 1986, 161–176
Cooper, L. and Cooper, M. W.: Introduction to Dynamic Programming, Pergamon Press, New York, 1981
Denardo, E. V. and Mitten, L. G.: Elements of Sequential Decision Processes, J. of Ind. Eng., Vol. 13, 1967, 106–112
Denardo, E. V.: Dynamic Programming—Models and Applications, Prentice-Hall, Englewood Cliffs, N, J., 1982
White, D. J.: Dynamic Progr., Holden-Day, San Francisco, CA., 1969
Mitten, L. G.: Composition Principles for Synthesis of Optimal Multistage Processes, Oper. Res., Vol. 12, 1964, 610–619
Bellman, R.: The Theory of Dynamic Programming, Bulletin of the AMS, Vol. 60, 1954, 503–515
Bellman, R.: Some Problems in the Theory of Dynamic Programming, Econometrica, Vol. 22, 1954, 37–48
Morin, T. L.: Monotonicity and the Principle of Optimality, J. of Mathematical Analysis and Applications, Vol. 86, 1982, 665–674
Porteus, E.: An Informal Look at the Principle of Optimality, Mgmt. Sci., Vol. 21, 1975, 1346–1348
Dreyfus, S. E. and Law, A. M.: The Art and Theory of Dynamic Programming, Academic press, New York, 1977
Neumann, K. und Niedereichholz, J.: Dynamische Programmierung—Theorie und Anwendungen, Bibliographisches Inst., Mannheim, 1969
Morin, T. L.: Computational Advances in Dynamic Programming, in VIII.1. 7–41, 1978
Puterman, M. L. (Ed.): Dynamic Programming and its Applications, Academic Press, New York, 1978
Carraway, R. L., Morin, T. L., and Moskowitz, H.: Generalized Dynamic Programming for Stochastic Combinatorial Optimization, Oper. Res., Vol. 37, No. 5, 1989, 819–829
Mitten, L. G.: Preference Order Dynamic Programming, Management Science, Vol. 21, 1976, 43–46
Sniedovich, M.: Dynamic Programming and the Principles of Optimality, J. Math. Anal. Appl., Vol. 65, 1978, 586–606
Henig, M. I.: The Principle of Optimality in Dynamic Programming, with Returns in Partially Ordered Sets, Math. Oper. Res., Vol. 10, 1985, 462–470
White, D.J.: Dynamic Programming, Markov Chains and the Method of Successive Approximations, J. of Mathematical Analysis and Appl., Vol. 6, 1963, 373–376
Piehler, J.: Einführung in die Dynamische Optimierung, Teubner, Leipzig, 1966
Carraway, R. L., Morin, T. L., and Moskowitz, H.: Generalized Dynamic Programming for Multicriteria Optimization, Eur. J. Oper. Res., Vol. 44, 1990, 95–104
Carraway, R. L.: Multicriteria Finite Dynamic Programming, Ph.D. Diss., Purdue Univ., 1984
Carraway, R. L and Morin, T. L.: Theory and Applications of Generalized Dynamic Programming—An Overview, Int. J. of Computers and Mathematics with Applications, Vol. 16, 1988, 779–788
Weinberg, F. (Ed.): Branch and Bound—Eine Einfuehrung, 2. Auflage, Springer, Berlin, 1973
Lawler, E. L. and Wood, D. E.: Branch and Bound Methods—a Survey, J. of the O. R. Society of America, Vol. 14, 1966, 699–719
Ibaraki, T.: Comput. Efficiency of Approximate Branch-and-Bound Algorithms, Math. of Oper. Res., Vol. 1, No. 3, 1979, 287–298
Mitten, L. G.: Branch-and-Bound Method—General Formulation and Properties, Operations Research, Vol. 18, 1970, 24–34
Morin, T. L. and Marsten, R. E.: Branch-and-Bound Strategies for Dynamic Programming, Oper. Res., Vol. 24, No. 4, 1976, 611–627
Rinnooy Kan, A. H. G.: On Mitten’s Axioms for Branch-and-Bound, Oper. Res., Vol. 24, No. 6, 1976, 1176–1178
Kolesar, P. J.: A Branch-and-Bound Algorithm for the Knapsack Problem, Mgmt. Sci., Vol. 13, 1967, 723–735
Martello, and Toth, P.: An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm, Eur. J. Oper. Res., Vol. 1, 1977, 169–175
Land, A. and Doig, A. G.: An Automatic Method of Solving Discrete Programming Problems, Econometrica, Vol. 28, 1960, 497–520
Garfinkel, R. S.: Branch-and-Bound Methods for Integer Programming, in VIII.1. 6–05, 1979
Tomlin, J. A.: An Improved Branch-and-Bound Method for Integer Programming, Oper. Res., Vol. 19, 1971, 1363–1373
Garfinkel, R. S. and Nemhauser, G. L.: Integer Progr., New York, 1972
Balas, E.: A Note on the Branch-and-Bound Principle, Univ. of Toronto, February 1967
Little, J. D. C., Murty, K. G., Sweeney, D. W., and Karel, C.: An Algorithm for the Traveling Salesman Problem, Oper. Res., Vol. 11, No. 6, 1963, 972–989
Beckmann, M. and Kuenzi, H. P. (Eds.): Einfuehrung in die Methode Branch and Bound, Springer, Berlin, 1968
Jeffreys, M.: Some Ideas on Formulation Strategies for Integer Programming Problems so as to Reduce the Number of Nodes Generated by a Branch-and-Bound Algorithm, Working Paper 74/2, Wootton, Jeffreys and Partners, London, 1974
Mitra, G.: Investigations of Some Branch and Bound Strategies for the Solution of Mixed-Integer Linear Programs, Math. Progr., Vol. 4, 1973, 155–170
Singhal, J.: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming, Diss., Dept. of Management Inf. Systems, Univ. of Arizona, 1982
Beale, E. M. L.: Branch-and-Bound Methods for Mathematical Programming, Annals of Discrete Mathematics, Vol. 5, 1979, 201–219
Ibaraki, T.: The Power of Dominance Relations in Branch and Bound Algorithms, J. of the ACM, Vol. 24, 1977, 264–279
Ibaraki, T.: Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems, Inf. Cont., Vol. 36, 1978, 1–27
Fischetti, M. and Toth, P.: An Additive Bounding Procedure for Combinatorial Optimization Problems, Oper. Res., Vol. 37, No. 2, 1989, 319–328
Tarjan, R. E.: Finding Cttimum Branchings, Networks, Vol. 7, 25–35
Smith, D. R.: Random Trees and the Analysis of Branch and Bound Procedures, Journal of the ACM, Vol. 31, No. 1, 1984
Glover, F.: Parametr. Branch and Bound, OMEGA, Vol. 6, 1978, 145–152
Glover, F. and Tangedahl, L.: Dynamic Strategeries for Branch-and-Bound, OMEGA, Vol. 4, 1976, 571–579
Bazaraa, M. S. and Elshafei, A. N.: On the Use of Fictitous Bounds in Tree Search Algorithms, Mgmt. Sci., Vol. 23, 1977, 904–908
Stone, H. S. and Sipala, P.: The Average Complexity of Depth-First Search with Bachtracking and Cutoff, IBM J. Res. and Dev., Vol. 30, No. 3, 1981, 242–258
Veniaminov, S. S.: Additional Cuttoff Rules for the Branch-and-Bound Method, Tekhnicheskaya Kibernetica, No. 3, 1984, 59–63
Skaletskii, V. V.: Modified Branch-and-Bound Method for Solving a Series of Problems, Automation and Remote Control, Vol. 49, No. 4, 1988, 493–499
Ibaraki, T.: Theoretical Comparisons of Search Strategies in Branch-and-Bound Algorithms, Intern. J. Comput. Inf. Sci., Vol. 5, No. 4, 1976, 315–344
Ibaraki, T.: On the Computational Efficiency of Branch-and-Bound Algorithms, J. Oper. Res. Soc. Japan, Vol. 20, 1977, 16–35
Breu, R. and Burdet, C. A.: Branch and Bound Experiments in 0–1 Programming, Math. Progr. Study, Vol. 2, 1974, 1–50
Jeroslow, R. G.: Trivial Integer Programs Unsolvable by Branch-and-Bound, Math. Progr., Vol. 6, No. 1, 1974, 105–109
Jaeschke, G.: Branching and Bounding—Eine allgemeine Methode zur Lösung kombinatorischer Probleme, Ablauf-and Planungsforschung, Vol. 5, No. 3, 1964
Kohlas, J.: Monte Carlo Simulation in Operation Research, Springer, Berlin, 1972
Sasaki, K.: Statistics for Morden Business Decision Making, Wadsworth Publishing Co., Belmont, California, 1968
Ross, S.: Applied Probability Models with Optimization Applications, Holden-Day, San Francisco, 1970
Bohachevsky, I. O., Johnson, M. E., and Stein, M. L.: Generalized Simulated Annealing for Function Optimization, Technometrics, Vol. 28, No. 3, August 1986, 209–217
Anily, S. and Federgruen, A.: Simulated Annealing Methods with Gen. Acceptance Probabilities, J. of Appl. Probab., Vol. 24, 1987
Krikpatrick, S., Gelatt, Jr. C. D., and Vecçhi, M. P.: Optimization by Simulated Annealing, Science, Vol. 220, No. 4598, 1983, 671–680
Lundy, M. and Mees, A.: Convergence of the Annealing Algorithm, Math. Progr., Vol. 34, 1986, 111–124
Fukao, T. and Zhao, Y.: Stochastic Distributed Optimization Algorithm, Trans. IECE Japan, J69-A, Vol. 12, 1986, 1492–1501
Romeo, F., Vincentelli, A., and Sechen, C.: Research on Simulated-Annealing at Berkeley, Proceedings ICCD, Oct. 1984, 652–657
Romeo, F., Vincentelli, A.: Probabilistic Hill Climbing Algorithms—Properties and Applications, Univ. of California, Berkeley, Report No. UCB/ERL M84 /34, 1984
Mitra, D., Romeo, F., Vincentelli, A.: Convergence and Finite Time Behavior of Simulated Annealing, Adv. Appl. Probab., Vol. 18, 1986, 747–771
Lasserre, J. B., Varaiya, P. P., and Walrad, J.: Simulated Annealing, Random Search, Multistart or SAD?, Systems and Control Letters, Vol. 8, 1987, 297–301
Dixon, L. C. W. and Szego, G. P. (Eds.): Toward Global Optimization, North Holland, Amterdam, 1975
Corana, A., Marchesi, M., Martini, C., and Ridella, S.: Minimizing Multimodal Functions of Continuous Variables with the Simulated Annealing Algorithm, ACM Trans. Math. Software, Vol. 13, No. 3, 1987, 262–280
Maffioli, F.: Randomized Algorithms in Combinatorial Optimization—A Survey, Discerte Applied Math., Vol. 14, 1986, 157–170
Chams, M., Hertz, A., and De Werra, D.: Some Experiments with Simulated Annealing for Coloring Graphs, Eur. J. Oper. Res., Vol. 32, 1987, 260–266
Burkard, R. E. and Rendl, F.: A Thermodynamically Motivated Simulated Procedure for Combinatorial Optimization Problems, Eur. J. of Oper. Res., Vol. 17, 1984, 169–174
Coffman, E. G. Jr., Lueker, G. S., and Rinnooy Kan, A. H. G: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics, Mgmt. Sci., Vol. 34, No. 3, 1988, 266–290
Karmarkar, N., Karp, R. M., Lueker, G. S., and Odlyzko, A. M.: Probabilistic Analysis of Optimum Partitioning, J. Appl. Probab., Vol. 23, 1986, 626–645
Buslenko, N. P.: The Monte-Carlo Method. The Method of Statistical Trials, Pergamon Press, Oxford, 1966
Kirkpatrick, S.: Optimization by Simulated Annealing—Quantitative Studies, J. Statist. Phys., Vol. 34, 1984, 975–986
Gelfand, S. B.: Analysis of Simulated Annealing Type Algorithms, Doctoral Thesis, M. I, T., Lab. for Inf. and Decision Systems, Cambridge, Mass., 1988
Price, W. L.: A Controlled Random Search Procedure for Global Optimization, in VIII.1. 9–13, 1978, 71–84
Price, W. L.: A Controlled Random Search Procedure for Global Optimization, Comput. J., Vol. 20, 1977, 367–370
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E.: Equations of State Calculations with Fast Computing Machines, J. Chem. Phy., Vol. 21, 1953, 1087–1091
Aigner, D.: Principles of Statistical Decision Making, Macmillan, London, 1968
Schreider, Y. A.: The Monte Carlo Method, Pergamon Press, New York, 1965
Sobol, I. M.: Die Monte Carlo Methode, VEB Deutscher Verlag der Wissenschaften, Berlin, 1971
Soran, P. D.: State-of-the-Art Monte Carlo 1988, Lawrence Livermore National Lab., Ca., 1988
Rinnooy Kan, A. H. G. and Timmer, G. T.: Stochastic Global Optimization Methods, Part I—Clustering Methods and Part II—Multi-Level Methods, Math. Progr., Vol. 39, No. 1, 1987, 27–56 and 57–80
Potschka, K.: Generatoren für Zufallszahlen, Angewandte Informatik, Heft 6, 1972, 263–268
Chambers, R.: Random Number Generation, IEEE Spectrum, 1967, 48–56
Karp, R.: Probabilistic Analysis of Partitioning Algorithms for the Travelling Salesman Problem in the Plane, Math. of Oper. Res., Vol. 2, 1977, 209–224
Johnson, D. S.: Optimization by Simulated Annealing—A Tutorial, ATandT Bell Laboratories, 12th Int. Sump. on Math. Progr., 1985
Devroye, L.: Progressive Global Random Search of Continuous Functions, Math. Progr., Vol. 15, 1978, 330–342
Brooks, S. H.: A Discussion of Random Methods for Seeking Maxima, Oper. Res., Vol. 6, 1958, 244–251
Boender, C. G. E., Rinnooy Kan, A. H. G., Stougie, L., and Timmer, G. T.: A Stochastic Method for Global Optimization, Math. Progr., Vol. 22, 1982, 125–140
Rinnooy Kan, A. H. G., Boender, C. G. E., and Timmer, G. Th.: A Stochastic Approach to Global Optimization, in VIII.1. 1–92, 1984, 282–308
Timmer, G. T.: Global Optimization—A Stochastic Approach, Ph.D. Diss., Erasmus Universiteit Rotterdam, Centrum Wiskunde en Informatica, Amsterdam, 1984
Solis, F. J. and Wets, R. J. E.: Minimization by Random Search Techniques, Math. of Oper. Res., Vol. 6, 1981, 19–30
Van Laarhoven, P. J. M. and Aarts, E. H. L.: Simulated Annealing —a Review of the Theory and Applications, Kluwer, Dordrecht, 1987
Cerny, V.: A Thermodynamical Approach to the Travelling Salesman—An Efficient Simulation Algorithm, J. Optim. Theory and Appl., Vol. 15, 1985, 41–51
Hajek, B. and Sasaki, G.: Simulated Annealing—to Cool or not, Syst. Control Letters, Vol. 12, No. 5, 1989, 443–447
Sasaki, G. and Hajek, B.: The Time Complexity of Maximum Matching by Simulated Annealing, J. ACM, Vol. 35, 1988, 387–403
Aarts, E. and Laarhoven, P.: Statistical Cooling—A Unified Approach to Combinatorial Optimization Problems, Philips J. Res., Vol. 40, Vol. 40, 1985, 193–226
Price, W. L.: Global Optimization by Controlled Random Search, J. Optimization Theory and Appl., Vol. 40, 1983, 333–348
Spirakis, P. G.: Probabilistic Algorithms, Algorithms with Random Inputs and Random Combinatorial Structures, Ph.D. Thesis, Harvard Univ., Dept. of Mathematics, 1981
Zemel, E.: Random Binary Search—A Randomizing Algorithm for Global Optimization in RI, Math. Oper. Res., Vol. 11, No. 4, 1986, 651–662
Archetti, F. and Betro, B.: A Probabilistic Algorithm for Global Optimization, Calcolo, Vol. 16, 1979, 335–343
Johnson, D. S., Aragon C. R., Mc Geoch, L. A., and Schevon, C.: Optimization by Simulated Annealing-An Experimental Evaluation, Part I-Graph Partitioning, Oper. Res., Vol. 37, No. 6, 1989, 865–892
Smith, R. L.: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed Over Bounded Regions, Oper. Res., Vol. 32, 1984, 1296–1308
Luus, R. and Brenek, P.: Incorporation of Gradient into Random Search Optimization, Chem. Eng. Technol., Vol. 12, No. 5, 1989, 309–318
Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts, 1989
Eglese, R. W.: Simulated Annealing-A Tool for Operational Research, Eur. J. Oper. Res., Vol. 46, No. 3, 1990, 271–281
Rutenbar, R. A.: Simulated Annealing Algorithms An Overview, IEEE Circuits and Devices Mag., Vol. 5, No. 1, 1989, 19–26
Foulds, L. R.: Heuristic Problem-Solving Approach, J. Oper. Res. Soc., Vol. 34, No. 10, 1983
Müller-Merbach, H.: Morphologie heuristischer Verfahren, Zeitschrift für Operations Research, Vol. 20, 1976, 69–87
Streim, H.: Heuristische Lösungsverfahren-Versuch einer Begriffserklärung, Zeitschr. für Oper. Res., Vol. 19, 1975, 143–162
Gere, W. S.: Heuristics in Job Scheduling, Mgmt. Sci., Vol. 13, 1966, 167–190
Warnecke, H. J., Warschat, J. und Heller, A.: Heuristische Optimierung diskreter Systeme, in VIII.1. 1–55, 1981
Sergienko, I. V. and Shilo, V. P.: Prababilistic Approach to Assessment of Heuristics in 0–1 Linear Progr., Cybernetics, Vol. 23, No. 1, 1987, 1–7
Karp, R. M. and Steele, J. M.: Probabilistic Analysis of Heuristics, in VIII.1. 6–199, 1985, 181–205
Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints, Decis. Sci., Vol. 8, 1977, 156–166
Kochenberger, G. A., Mc Carl, B. A., and Wyman, F. P.: A Heuristic for General Integer Programming, Decis. Sci., Vol. 15, 1968, B196 - B207
Thompson, G. L. and Karp, R. L.: A Heuristic Approach to Solving Traveling Salesman Problems, Mgmt. Sci., Vol. 10, 1964, 225–247
Pearl, J.: Heuristic-Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, Mass., 1984
Balas, E. and Martin, R. K.: Pivot and Complement-A Heuristic for 0–1 Programming, Mgmt. Sci., Vol. 26, No. 1, 1980, 86–96
Zanakis, S. H. and Evans, J. R.: Heuristic Optimization-Why, When and How to Use it, Interfaces, Vol. 11, 1981, 84–89
Evans, J. R.: Structural Analysis of Local Search Heuristics in Combin. Optimization, Comput. Oper. Res., Vol. 14, 1987, 465–477
Glover, F. and Greenberg, H. J.: New Approaches for Heuristic Search-A Bilateral Linkage with Artificial Intelligence, Eur. J. Oper. Res., Vol. 39, No. 2, 1989, 119–130
Glover, F.: Tabu Search-Part I, ORSA Journal on Computing, Vol. 1, No. 3, 1989, 190–206
Roy, B.: Problems and Methods with Multiple Objective Functions, Math. Progr., Vol. 1, 1971, 239–266
Keeney, R. L. and Raiffa, H.: Decision Analysis with Multiple Conflicting Objectives, Wiley, New York, 1976
Fandel, G. und Wilhelm, J.: Zur Entscheidungstheorie bei mehrfacher Zielsetzung, Zeitschr. für Oper. Res., Vol. 20, No. 1, 1976, 1–21
Briskin, L. E.: A Method for Unifying Multiple Objective Functions, Mgmt. Sci., Vol. 12, No. 10, 1966
Geoffrion, A. M.: Solving Bicriterion Mathematical Programs, Oper. Res., Vol. 15, 1967, 39–545
Benayoun, R., De Montgolfier, J., Tergny, J., and Laritchev, O.: Linear Progr. with Multiple Objective Functions-STEP Method (STEM), Math. Progr., Vol. 1, 1971, 366–375
Rosenthal, R. E.: Principles of Multiobjectives Optimization, Naval Postgraduate School, Monterey, CA, US Government Technical Rept. No. AD-A147520, 1984
Ignizio, J. P.: Linear Programming in Single and Multiple Objective Systems, Prentice-Hall, New Jersey, 1982
Zionts, S. (Ed.): Multiple Criteria Problem Solving, Springer Verlag, New York, 1978
Sadagopan, S.: Multiple Criteria Mathematical Programming—A Unified Interactive Approach, Ph.D. Diss., School of Industrial Eng., Purdue Univ. West Lafayette, In., December 1979
Ignizio, J. P.: Linear Programming in Single and Multiple Objective Systems, Prentice-Hall; Englewood Cliffs, New Jersey, 1982
Steuer, R. E.: Generating Efficient Extreme Points in Linear Multiple Programming Theory and Computational Experience, Doctoral Diss., Univ. of North Carolina, 1973
Reeves, G. R. and Reid, R. C.: Minimum Values Over the Efficient Set in Multiple Objective Decision Making, Eur. J. Oper. Res., Vol. 36, No. 3, 1988, 334–338
Sadagopan, S. and Ravindran, A.: Interactive Solution of Bi-Criteria Math. Programs, Nay. Res. Logist. Quart., Vol. 29, No. 3, 1982
Cochrane, J. L. and Zeleny, M.: Multiple Criteria Decision Making, Univ. of South Carolina Press, Columbia, South Carolina, 1973
Evans, J. P. and Steuer, R. E.: A Revised Simplex Method for Linear Multiple Objective Programming, Math. Progr., Vol. 5, 1973, 1
Zimmermann, H.-J.: Fuzzy Programming and Linear Progr. with Several Objective Functions, Fuzzy Sets and Systems, Vol. 1, 1978, 45–56
Luhandjula, M. K.: Fuzzy Approaches for Multiple Objective Linear Fract. Optimization, Fuzzy Sets and Systems, Vol. 13, 1984, 11–24
Hannan, E. L.: Linear Programming with Multiple Fuzzy Goals, Fuzzy Sets and Systems, Vol. 6, 1981, 235–248
Geoffrion, A. M.: Proper Efficiency and the Theory of Vector Maximization, Journal of Math. Analysis and Appl., Vol. 22, 1968, 618–630
Klahr, C. N.: Multiple Objectives in Mathematical Programming, Operations Research, Vol. 6, 1958, 849–855
Strebel, H.: Zur Gewichtung von Urteilskriterien bei mehrdimensionalen Zielsystemen, Zeitschr, für Betriebswirtschaft, Vol. 42, 1972, 89–128
Dinkelbach, W.: Unternehmerische Entscheidungen bei mehrfacher Zielsetzung, Zeitschr. für Betriebswirtschaft, Vol. 32, 1962, 739
Bod, P.: Programmation lineaire dans le cas de plusiers fonctions objectifs donnees simultanement (en hongrois), Publ. by the Math. Inst. of the Hungarian Academy of Sciences, Vol. 8, 1963, 541–554
Zimmermann, H.-J.: Multi Criteria Decision Making in Crisp and Fuzzy Environments, in Vííí.1. 12–24, 1986
Hwang, Ch.-L. and Yoon, K.: Multiple Attribute Decision Making, Springer, Berlin, 1981
Hwang, Ch.-L. and Masud, A. S.: Multiple Objective Decision Making, Methods and Applications, Springer, Berlin, 1979
Baas, M. S. and Kwakernaak, H.: Rating and Ranking of Multiple-Aspect Aternatives Using Fuzzy Sets, Automatica, Vol. 13, 1977, 47–58
Buckley, J. J.: Ranking Alternatives Using Fuzzy Numbers, Fuzzy Sets and Systems, Vol. 15, 1985, 21–32
Johnson, E.: Studies in Multiobjective Decision Models, Lund, 1968
Rhode, R. und Weber, R.: Effiziente Punkte in linearen Vektormaximumproblemen, in VIII.1. 1–55, 1981
Blin, J. M.: Fuzzy Sets in Multiple-Criteria Decision Making, in VIII.1. 11–33, 1977
Slarr, M. K. and Zeleny, M. (Eds.): Multiple-Criteria Decision Making, Academic Press, New York, 1977
Saaty, T. L.: Exploring the Interface Between Hierarchies, Multiple Objectives, and Fuzzy Sets, Fuzzy Sets and Systems, Vol. 1, No. 1, 1978, 57–68
Rommelfanger, H.: Zur Lösung linearer Vektoroptimierungssysteme mit Hilfe der Fuzzy Set Theory, in VIII.1. 1–57, 1985, 431–438
Leberling, H.: On Finding Compromise Solutions in Multicriteria Problems Using the Fuzzy Min-Operator, Fuzzy Sets and Systems, Vol. 6, 1981, 105–118
Leberling, H.: Entscheidungsfindung bei divergierenden Faktorinteressen und relaxierten Kapazitätsrestriktionen mittels eines unscharfen’ Lösungsansatzes, Zeitschr. für betriebsw. Forschung, Vol. 35, 1983, 398–419
Luc, D. T.: Scalarization of Vector Optimization Problems, J. Optim. Theory and Appl., Vol. 55, No. 1, 1987, 85–102
Steuer, R. E.: Multiple Criteria Optimization—Theory, Computation, and Application, Wiley, New York, 1986
Steuer, R. E.: Multiple Criteria Linear Programming with Interval Criterion Weights, Mgmt. Sci., Vol. 23, 1976, 305–316
Hansen, P., Labbe, M., and Wendell, R. E.: Sensitivity Analysis in Multiple Objective Linear Programming—The Tolerance Approach, Eur. J. Oper. Res., Vol. 38, No. 1, 1989, 63–69
Yano, H. and Sakawa, M.: A Unified Approach for Characterizing Pareto Optimal Solutions of Multiobjective Optimization Problems—The Hyperplane Method, Eur. J. Oper. Res., Vol. 39, 1989, 61–70
Chankong, V. and Haimes, Y. Y.: Multiobjective Decision Making—Theory and Methodology, North-Holland, New York, 1983
Sakawa, M.: Optimization in Nonlinear Systems with Single and Multiple Objectives, Morikita, Tokyo, 1986 (in Japanese)
Jahn, J.: Some Characterizations of the Optimal Solutions of a Vector Optimization Problem, OR Spektrum, Vol. 7, 1985, 7–17
Evans, G. W.: An Overview of Techniques for Solving Multiobjective Math. Programs, Mgmt. Sci., Vol. 30, No. 11, 1984, 1268–1282
Zionts, S.: Integer Linear Programming with Multiple Objectives, Annals of Discrete Mathematics, Vol. 1, 1977, 551–562
Henig, M. L.: Multicriteria Dynamic Programming, Ph.D. Diss., Yale Univ., 1978
Zeleny, M.: Linear Multiobjective Programming, Ph.D. Diss., Graduate School of Mgmt., The Univ. of Rochester, New York, 1972
Zeleny, M.: Mult. Criteria Dec. Making, Mc Graw-Hill, New York, 1982
Yu, P. L. and Zeleny, M.: The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method, J. Math. Anal. Appl., Vol. 49, 1975, 430–468
Fandel, G. and Gal, T. (Eds.): Multiple Criteria Decision Making—Theory and Application, Springer, Berlin, 1980
Thiriez, H. and Zionts, S. (Eds.): Multiple Criteria Decision Making, Springer, Berlin, 1976
Mc Millan, C.: Mathematical Programming with Multiple Objectives, in VIII.1. 1–110, 1975
Klein, D. and Hannan, E.: An Algorithm for the Multiple Objective Integer Linear Programming Problem, Eur. J. of Oper. Res., Vol. 9, 1982, 378–385
Benson, R. G.: Interactive Multiple Criteria Optimization Using Satisfactory Goals, Ph.D. Diss., Univ. of Iowa, 1975
Benson, H. P.: Vector Maximization with Two Objective Functions, J. Optim. Theory Appl., Vol. 28, 1979, 253–257
Bitran, G. R.: Linear Multiple Objective Programs with Zero-One Variables, Math. Progr., Vol. 13, 1977, 121–139
Bitran, R. G.: Theory and Algorithms for Linear Multiple Objective Programs with Zero-One Variables, Math. Progr., Vol. 17, 1979, 362
Roy, B.: Methodologie Multicritere d’Aide a la Decision, Economica, Paris, 1985
Cohon, J. L.: Multi-Objective Programming and Planning, Academic Press, New York, 1978
Lootsma, F. A.: Optimization with Multiple Objectives, Reports of the Faculty of Technical Mathematics and Informatics, No. 88–75, Delft Univ. of Technology, Delft, 1988
Ignizio, J. P.: Goal Programming and Extensions, Lexington Books, Lexington, Mass., 1976
Yu, P. L.: Multiple Criteria Decision Making—Concepts, Techniques and Extensions, Plenum Press, New York, 1985
Chankong, V. and Haimes, Y. Y.: On the Characterization of Noninferior Solutions of the Vector Optimization Problem, Automatica, Vol. 18, 1982, 697–707
Zionts, S.: A Survey of Multiple Criteria Integer Programming Methods, Annals of Discrete Mathematics, Vol. 5, 1979
Zionts, S.: Multiple Criteria Mathematical Programming—An Updated Overview and Several Approaches, in X-259, 1988, 135–167
Sakawa, M. and Yano, H.: Trade-Off Rates in the Hyperplane Method for Multiobjective Optimization Problems, Eur. J. Oper. Res., Vol. 44, No. 1, 1990, 105–118
Ramesh, R., Karwan, M. H., and Zionts, S.: Interactive Method for Bicriteria Integer Programming, IEEE Trans. Syst. Man and Cybern., Vol. 20, No. 2, 1990, 395–403
Marcotte, O. and Soland, R. M.: An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization, Mgmt. Sci., Vol. 32, No. 1, 1986
Ferreira, P. A. V. and Geromel, J. C.: Interactive Projection Method for Multicriteria Optimization Problems, IEEE Trans. Syst. Man and Cybern., Vol. 20, No. 3, 1990, 596–605
White, D. J.: A Bibliography on the Applications of Mathematical Programming Multiple Objective Methods, J. Oper. Res. Soc. (UK), Vol. 41, No. 8, 1990, 669–691
Pratt, J., Raiffa, H., and Schlaifer, R.: The Foundations of Decisions under Uncertainty, J. of the American Statistical Ass., Vol. 59, No. 306, 1964, 353–375
Runzheimer, B.: Operations Research, Band 2: Methoden der Entscheidungsfindung bei Risiko, Gabler, Wiesbaden, 1978
Bereanu, B.: On the Use of Computers in Planning under Conditions of Uncertainty, Vol. 15, No. 1, 1975, 11–32
Stancu-Minasian, I. M. and Wets, M. J.: A Research Bibliography in Stochastic Programming, 1955–1975, Oper. Res., Vol. 24, No. 6, 1976, 1078–1119
Orlovski, S. A.: On Programming with Fuzzy Constraint Sets, J. Cybernetics, Vol. 6, 1977, 197–201
Bereanu, B.: On Stochastic Linear Programming, Revue Mathem. Pures et Appliquees, Vol. 8, 1963, 683–697
Bereanu, B.: Programme de risque minimal en programmation lineaire stochastique, C. R. Acad. Sci. (Paris), Vol. 259, No. 5, 1964, 981
Kall, P.: Stochastic Linear Programming, Springer, Berlin, 1976
Kall, P.: Der gegenwärtige Stand der stochastischen Programmierung, Unternehmensforschung, Vol. 12, No. 2, 1968, 81–95
Schneeweiss, H.: Ein allgemeines Schema des Stochastischen Programmierens, Statistische Hefte, Vol. 3, No. 3, 1963
Vajda, S.: Probabilistic Progr., Academic Press, New York, 1972
Vajda, S.: Inequalities in Stochastic Linear Programming, Bulletin of the Int. Statistical Institute, Vol. 36, 1958, 357–363
Sinha, S. M.: Stochastic Programming, Univ. of California, Oper. Res. Center, ORC-63–22, Berkeley, CA., 1963
Faber, M. M.: Stochastisches Programmieren, Physica, Würsburg, 1970
Wets, R.: Programming under Uncertainty, The Complete Problem, Boeing Scientific Research Laboratories, 1964
Wessels, J.: Stochastic Programming, Statistica Neerlandica, Voi. 21, 1967, 39–53
Bellman, R. and Zadeh, L. A.: Decision-Making in a Fuzzy Environment, Mgmt. Sci., Vol. 17, No. 4, 1970, 141–164
Rödder, W. und Zimmermann, H.-J.: Analyse, Beschreibung und Optimierung von unscharf formulierten Problemen, Zeitschr. für Oper. Res., Vol. 21, No. 1, 1977, 1–18
Falk, J. E.: Exact Solutions of Inexact Linear Programs, Operations Research, Vol. 24, No. 4, 1976, 783–787
Zimmermann, H.-J.: Optimale Entscheidungen bei unscharfen Problembeschr., Zeitschr. für betriebsw. Forsch., Vol. 27, 1975, 785–795
Zimmermann, H.-J.: Fuzzy Set Theory—and its Applications, D. Reidel Publ. Company, 1985
Zimmermann, H.-J.: Description and Optimization of Fuzzy Systems, Intern. J. Gen. Systems, Vol. 2, 1976, 209–215
Zadeh, L. A.: Fuzzy Sets, Inf. and Control, Vol. 8, 1965, 338–353
Jones A., Kaufmann, A. and Zimmermann, H.-J. (Eds.): Fuzzy Sets Theory and Applications, D. Reidel Publishing Company, Dordrecht, Holland, 1986
Zimmermann, H.-J., Zadeh, L. A., and Gaines, B. R. (Eds.): Fuzzy Sets and Decision Analysis, New York, 1984
Fabian, L. and Stoica, M.: Fuzzy Integer Programming, in VIII. 1. 12–25
Kaufmann, A.: Introduction to the Theory of Fuzzy Subsets, Academic Press, New York, 1975
Bellman, R. and Giertz, M.: On the Analytic Formalism of the Theory of Fuzzy Sets, Inform. Sci., Vol. 5, 1973, 378–390
Behringer, F. A.: Optimale Entscheidungen bei Unsicherheit und Spiele unter Ausnutzung der Fehler des Gegners, Doctor Habil. Thesis, Techn. Universität München, 1975
Zadeh, L. A.: Fuzzy Sets as a Basis for a Theory of Possibility, Fuzzy Sets and Systems, Vol. 1, 1978, 3–29
Zimmermann, H.-J.: Fuzzy Programming and Linear Programming with Several Objective Functions, Fuzzy Sets and Systems, Vol. 1, 1978, 45–56
Luhandjula, M. K.: Linear Programming under Randomness and Fuzziness, Fuzzy Sets and Systems, Vol. 10, No. 2, 1983, 123–134
Ostasiewicz, W.: A New Approach to Fuzzy Programming, Fuzzy Sets and Systems, Vol. 7, 1982, 139–152
Tanaka, H. and Asai, K.: Fuzzy Linear Programming Problems with Fuzzy Numbers, Fuzzy Sets and Systems, Vol. 13, 1984, 1–10
Tanaka, H., Okuda, T., and Asai, K.: on Fuzzy Mathematical Programming, J. Cybernetics, Vol. 3, 1974, 37–46
Kandel, A.: Fuzzy Mathematical Techniques with Applications, Addison-Wesley, Reading, Mass., 1986
Zimmermann, H.-J.: Multi Criteria Decision Making in Crisp and Fuzzy Environments, in VIII. 12–24, 1986
Albach, H.: Wirtschaftlichkeitsrechnung bei unsicheren Erwartungen, Westdeutschr Verlag, Köln-Opladen, 1959
Zadeh, L. A.: From Circuit Theory to System Theory, Proc. Institute of Radio Engineers, Vol. 50, 1962, 856–865
Zimmermann, H.-J.: Fuzzy Set Theory and Mathematical Programming, in VIII.1. 2–24, 1986, 99–114
Kaufmann, A.: Fuzzy Subsets Applications ip OR and Management, in VIII.1. 2–24, 1986, 257–299
Zimmermann, H.-J.: Fuzzy-Sets in Operations Research—eine Einfuehrung in Theorie und Anwendungen, in VIII.1. 1–57, 1985
Giles, R.: A Formal System for Fuzzy Reasoning, Fuzzy Sets amd Systems, Vol. 2, No. 3, 1980, 233–258
Gluss, B.: Fuzzy Multistage Decision Making, Int. J. Control, Vol. 7, 1973, 177–192
Dubois, D. and Prade, H.: Fuzzy Sets and Systems—Theory and Applications, Academic Press, New York, 1979
Dubois, D. and Prade, H.: Theorie des possibilities, Masson, Paris, 1985
Kickert, W. J. M.: Fuzzy Theories in Decision Making, Martims Mijhoff, Leiden, Netherlands, 1978
Lakov, D. R. and Naplatanoff, N.: Decision Making in Vague Conditions, Kybernetes, Vol. 6, 1977, 91–93
Levi, I.: Gambling with Truth, M. I. T. Press, Cambridge, Mass., 1967
Mamdani, E. H. and Gaines, B. R. (Eds.): Fuzzy Reasoning and its Applications, Academic Press, London, 1981
Mizumoto, M. and Zimmermann, H.-J.: Comparison of Fuzzy Reasoning Methods, Fuzzy Sets and Systems, Vol. 8, No. 3, 1982, 253–284
Natvig, B.: Possibility Versus Probability, Fuzzy Sets and Systems, Vol. 10, No. 1, 1983, 31–36
Negoita, C. V.: The Current Interest in Fuzzy Optimization, Fuzzy Sets and Systems, Vol. 6, No. 3, 1981, 261–270
Negoita, C. V. and Ralescu, D. A.: On Fuzzy Optimization, Kybernetics, Vol. 6, 1977, 193–195
Negoita, C. V., Flondor, P., and Sularia, M.: On Fuzzy Environments in Optimization Problems, Econ. Comput. Econ. Cybernet. Stud. Res., 1977, 13–24
Negoita, C. V.: Fuzzy Systems, Tunbridge Wells, England, 1981
Negoita, C. V. and Sularia, M.: Fuzzy Linear Programming and Tolerances in Planning, Econ. Comput. Econ. Cybernet. Stud. Res., Vol. 1, 1976, 3–15
Nishida, T. and Takeda, E.: Fuzzy Sets and its Applications, Morikita (in Japanese), Tokyo, 1978
Wang, P. P. and Chang, S. K.: Fuzzy Sets, Plenum Press, New York, 1980
Wang, P. P.: Advances in Fuzzy Sets, Possibility Theory and Applications, Plenum Press, New York, 1983
Zimmermann, H.-J. und Zysno, P.: Zugehörigkeitsfunktionen unscharfer Mengen, DFGForschungsbericht, 1982
Skala, H. J., Termini, S., and Trillas, E. (Eds:): Aspects of Vagueness, D. Reidel, Dordrecht, 1984
Rommelfanger, H.: Linear Ersatzmodelle für lineare Fuzzy-Optimierungsmodelle mit konkaven Zugehörigkeitsfunktionen, Discussion Paper des Instituts für Statistik und Mathematik, Fachbereich Wirtschaftswiss., Johann-Wolfgang-Goethe Univ., Frankfurt/M., 1983
Trappey, J.-F. C., Liu, C. R., and Chang, T. C.: Fuzzy Non-Linear Programming—Theory and Application in Manufacturing, Int. J. Prod. Res., Vol. 26, No. 5, 1988, 975–985
Zimmermann, H.-J.: Modeling and Solving III-Structured Problems in Operations Research, Anal. of Fuzzy Inf., Publ. by CRC Press Inc., Boca Raton, Florida, 1987, 217–240
Akhmetzhanova, Z. Zh. and Baken, G. M.: Solution of a Programming Problem with Inexactly Specified Initial Data, Soy. J. Autom. Inf. Sci., Vol. 21, No. 2, 1988, 55–58
Naeslund, B.: Mathematical Programming under Risk, Swedish Journal of Economics, Vol. 18, 1965, 204–255
Sengupta, J.: Stochastic Programming, Method and Applications, North-Holland, Amsterdam, 1972
Rommelfanger, H.: Interactive Decision Making in Fuzzy Linear Optimization Probl., Eur. J. Oper. Res., Vol. 41, No. 2, 1989, 210–217
Rommelfanger, H., Hanuscheck, R., and Wolf, J.: Linear Programming with Fuzzy Objectives, Fuzzy Sets and Systems, Vol. 29, 1989, 31–48
Carlsson, C. and Korhonen, P.: A Parametric Approach to Fuzzy Linear Programming, Fuzzy Sets and Systems, Vol. 20, 1986, 17–30
Wets, R. J.-B.: Stochastic Programming Solution Techniques and Approximation Schemes, in VIII.1. 1–16, 1983, 566–603
Glynn, P. W.: Optimization of Stochastic Systems Via Simulation, Stanford Univ., Dept. of Oper. Res., Techn. Rept. TR-43, 1989
Luhandjula, M. K.: On Possibilistic Linear Programming, Fuzzy Sets and Systems, Vol. 18, 1986, 15–30
Ramik, J. and Rimanek, J.: Inequality Relation Between Fuzzy Numbers and it’s Use in Fuzzy Optimization, Fuzzy Sets and Systems, Vol. 16, 1985, 123–138
Yazenin, A. V.: Fuzzy and Stochastic Programming, Fuzzy Sets ans Systems, Vol. 22, 1987, 171–180
Zimmermann, H.-J.: Applications of Fuzzy Set Theory to Mathematical Programming, Inform. Sci., Vol. 36, 1985, 29–58
VIII.2 Mathematische Grundlagen
Heinhold, J. und Riedmüller, B.: Einfuehrung in die höhere Mathematik, Teil 1, Hanser Verlag, München, 1976
Heinhold, J. und Behringer, F.: Einfuehrung in die Mathematik, Teil 2, Infinitesimalrechnung, Hanser Verlag, München, 1976
Riordan, J.: An Introduction to Combinatorial Analysis, Chapman and Hall, London, 1958
Feller, W.: An Introduction into Probability Theory and its Applications, Vol. I and Vol. II, Wiley, New York, 1968–1971
Berge, C.: The Theory of Graphs and its Appl., Methuen-Wiley, 1962
Noltemeier, H.: Graphentheorie—Mit Algorithmen un Anwendungen, de Gruyter, Berlin, 1976
Mehlhorn, K.: Data Structures and Algorithms, Vol. 1 Sorting and Searching, Vol. 2 Graph Algorithms and NP-Completeness, Vol. 3 Multi-demensional Searching and Comp. Geometry, Springer, Berlin, 1984
Mehlhorn, K.: Effiziente Algorithmen, Teubner, Stuttgart, 1977
Shisha, O. (Ed.): Inequalities III, Academic Press, New York, 1972
Price, W. L.: Graphs and Networks, Auerbach Publishers, Princeton, N. J., 1971
Motzkin, T. S.: Beiträge zur Theorie der linearen Ungleichungen, Diss., Basel 1933 und Jerulalem 1936
Galperin, A. M.: The General Solution of a Finite System of Linear Inequalities, Math. of Oper. Res., Vol. 1, No. 2, 1976, 185–196
Rockafeller, R. T.: Convex Analysis, Princeton Univ. Press, N. J., 1970
Morgan, P. A. P.: An Introduction to Probability Theory, Oxford Univ. Press, 1968
Chirstofides, N.: Graph Theory—An Algorithmic Approach, Academic Press, New York, 1975
Alexandroff, P. S.: Einfuehrung in die Mengenlehre, VEB Deustscher Verlag der Wissenschaften, Berlin, 1956
Springer, C. H., Herlihy, R. E., and Beggs, R. I.: Basic Mathematics (1), Advanced Methods and Models ( 2 ), R. D. Irwin, Homewood, III., 1965
Stiefel, E.: Einfuehrung in die Numerische Mathematik, Teubner, Stuttgart, 1961
Flachsmeyer, J.: Kombinatorik. Eine Einfuehrung in die Mengentheoretische Denkweise, VEB Deutscher Verlag der Wissenschaften, Berlin, 1969
Knoedel, W.: Graphentheoretische Methoden und ihre Anwendungen, Springer, Berlin, 1969
Valentine, F. A.: Convex Sets, McGraw-Hill Book Company, New York, 1964
Bonnesen, T. und Fenchel, W.: Theorie der knovexen Körper, Springer Verlag 1934 und Chelsea Publ. Company, New York, 1948
Saaty, T. L. and Bram, J.: Nonlin. Math., McGraw-Hill, New York, 1964
Beckenbach, E. F. and Bellman, R.: Inequalities, Springer, Berl., 1961
Bodewing, W. H.: Matrix Calculus, North Holland, Amsterdam, 1956
Fleming, W. H.: Functions of Several Variables, McGraw-Hill, New York, 1965
Ortega, J. M. and Rheinboldt, W. C.: Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970
Hestenes, M. R.: Calculus of Variations and Optimal Control Theory, Wiley, New York, 1966
Traub, J. F.: Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, N. J., 1964
Garey, M. R. and Johnson, D. S.: A Guide to the Theory of NP-Completeness, San Francisco, 1979
Welsh, D. J. A.: Matriod Theory, Academic Press, London, 1976
Harary, F.: Graph Theory, Addison-Wesley, Reading, MA., 1969
Golub, G. H. and Van Loan, C. F.: Matrix Computations, John Hopkins Univ. Press, Baltimore, MD., 1983
Gondran, M. and Minoux, M.: Graphs and Algorithms, Wiley Intersc., New York, 1984
Pissanetzky, S: Sparse Matrix Tech., Academic Pr., New York, 1984
Bunch, J. R. and Rose, D. J. (Eds.): Sparse Matrix Computations, Academic Press, New York, 1976
Renye, A.: Found. of Probability, Holden-Day Inc., San Franc., 1970
Stoer, J. and Bulirsch, R.: Introduction to Numerical Analysis, Springer, New York, 1980
Watson, G. A. (Ed.): Numerical Analysis, Lecture Notes in Math., No. 630, Springer, Berlin, 1977
Hennart, J. P.: Numerical Analysis, Lecture Notes in Math. 909, Proceedings, Cocoyoc, Mexico, 1981, Springer, New York, 1982
Nikaido, H.: Introduction to Sets and Mappings in Modern Economics, North-Holland, Amsterdam, 1970
Ponstein, J.: Seven Kinds of Convexity, SIAM Review, Vol. 9, 1967, 115–119
Stewart, G. W.: Intr. to Matrix Comput., Academic Press, London, 1973
Grünbaum, B.: Convex Polytops, Wiley, New York, 1967
Strang, G.: Intr. to Applied Mathematics, Wellesley, MA., 1986
Dean, B. V., Sasieni, M. W., and Gupta, S. K.: Mathematics for Modern Management, Wiley, New York, 1963
Berge, C.: Topological Spaces, Macmillan, New York, 1963
Berge, C.: Graphes et Hypergraphes, Dunod, Paris, 1970
Berge, C.: Principes de combinatoire, Dunod, Paris, 1968
Papoulis, A.: Probability, Random Variables and Stochastic Processes, McGraw-Hill, New York, 1984
Halmos, P. R.: Naive Set Theory, Springer, New York, 1974
Kaufmann, A.: Graphs, Dynamic Programming and Finite Games, Academic Press, New York, 1967
Pararrizos, K. and Solow, D.: Finite Improvement Algorithm for the Linear Complementarity Problem, Eur. J. Oper. Res., Vol. 39, No. 3, 1989, 305–324
Ingleton, A. W.: A Problem in Linear Inequalities, Proceedings of the London Mathematical Society, Third Series 16, 1966, 81–93
Bondy, J. A. and Murty, U. S. R.: Graph Theory with Applications, Macmillan, London, 1976
Jungnickel, D.: Graphen, Netzwerke und Algorithmen, Bibliographisches Institut, Mannheim, 1987
Von Randow, R.: Introduction to the Theory of Matroids, Springer, New York, 1975
Deo, N.: Graph Theory with Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1974
Rose, D. J. and Willoughby, R. A. (Ed.): Sparse Matrices and their Applications, Plenum Press, New York, 1972
Gustayson F. G.: Some Basic Techniques for Solving Sparse Systems of Linear Equations, in VIII. 2–59, 1972, 41–52
Brayton, R. K., Gustayson, F. G., and Willoughby, R. A.: Some Results on Sparse Matrices, Math. of Computation, Vol. 24, 1970, 937–954
Forsythe, G. and Moler, C. B.: Computer Solution of Linear Algebraic Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1967
Lay, S. R.: Convex Sets and their Applications, Wiley, New York, 1982
Mirsky, L.: An Intr. to Linear Algebra, Dover, New York, 1982
Fourer, R.: Staircase Matrices and Systems, SIAM Review, Vol. 26, 1984, 1–70
Brannin, F. H. Jr.: Widely Convergent Method for Finding Multiple Solutions of Simult. Nonlinear Equat., IBM J. Res. Dev., 1972, 504
Ross, K. A. and Wright, C. R.: Discrete Mathematics, Prentice-Hall, Englewood Cliffs, New Jersey, 1985
Devlin, K.: Stemstuden der Modernen Mathematik, Birkhäuser, Basel, 1990
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Littger, K. (1992). Auswahl von theoriebezogenen Veröffentlichungen. In: Optimierung. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87729-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-87729-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87730-8
Online ISBN: 978-3-642-87729-2
eBook Packages: Springer Book Archive