Riassunto
Sono tre i tipi di algoritmi di Programmazione Lineare che hanno avuto il maggiore impatto: l’Algoritmo del Simplesso (si veda la Sezione 3.2), gli algoritmi di punto interno, e il Metodo dell’Ellissoide.
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.
Riferimenti bibliografici
Letteratura generale
Grötschel, M., Lovász, L., Schrijver, A. [1988]: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin
Padberg, M. [1999]: Linear Optimization and Extensions. Second edition. Springer, Berlin
Schrijver, A. [1986]: Theory of Linear and Integer Programming. Wiley, Chichester
Riferimenti citati
Bland, R.G., Goldfarb, D., Todd, M.J. [1981]: The ellipsoid method: a survey. Operations Research 29, 1039–1091
Edmonds, J. [1967]: Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards B 71, 241–245
Frank, A., Tardos, É. [1987]: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7, 49–65
Gács, P., Lovász, L. [1981]: Khachiyan’s algorithm for linear programming. Mathematical Programming Study 14, 61–68
Grötschel, M., Lovász, L., Schrijver, A. [1981]: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197
Iudin, D.B., Nemirovskii, A.S. [1976]: Informational complexity and effective methods of solution for convex extremal problems. Ekonomika i Matematicheskie Metody 12, 357–369 [in Russian]
Karmarkar, N. [1984]: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395
Karp, R.M., Papadimitriou, C.H. [1982]: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11, 620–632
Khachiyan, L.G. [1979]: A polynomial algorithm in linear programming [in Russian]. Doklady Akademii Nauk SSSR 244, 1093–1096. English translation: Soviet Mathematics Doklady 20, 191–194
Khintchine, A. [1956]: Kettenbrüche. Teubner, Leipzig
Padberg, M.W., Rao, M.R. [1981]: The Russian method for linear programming III: Bounded integer programming. Research Report 81-39, New York University
Shor, N.Z. [1977]: Cut-off method with space extension in convex programming problems. Cybernetics 13, 94–96
Steinitz, E. [1922]: Polyeder und Raumeinteilungen. Enzyklopädie der Mathematischen Wissenschaften, Band 3, 1–139
Tardos, É. [1986]: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34, 250–256
Vaidya, P.M. [1996]: A new algorithm for minimizing convex functions over convex sets. Mathematical Programming 73, 291–341
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Italia
About this chapter
Cite this chapter
Korte, B., Vygen, J. (2011). Algoritmi di programmazione lineare. In: Ottimizzazione Combinatoria. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-1523-4_4
Download citation
DOI: https://doi.org/10.1007/978-88-470-1523-4_4
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-1522-7
Online ISBN: 978-88-470-1523-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)