Riassunto
Il Problema del Matching Perfetto di Peso Minimo e il Problema dell’Intersezione Pesata di Matroidi discussi nei capitoli precedenti sono tra i problemi più “difficili” tra quelli per cui si conosce un algoritmo polinomiale. In questo capitolo trattiamo il problema seguente, che risulta essere in un certo senso, il più ”facile” tra i problemi NP-difficili.
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
Garey, M.R., Johnson, D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Chapter 4
Kellerer, H., Pferschy, U., Pisinger, D. [2004]: Knapsack Problems. Springer, Berlin
Martello, S., Toth, P. [1990]: Knapsack Problems; Algorithms and Computer Implementations. Wiley, Chichester
Papadimitriou, C.H., Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, Sezioni 16.2, 17.3, and 17.4
Riferimenti citati
Bellman, R. [1956]: Notes on the theory of dynamic programming IV — maximization over discrete sets. Naval Research Logistics Quarterly 3, 67–70
Bellman, R. [1957]: Comment on Dantzig’s paper on discrete variable extremum problems. Operations Research 5, 723–724
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E. [1973]: Time bounds for selection. Journal of Computer and System Sciences 7, 448–461
Dantzig, G.B. [1957]: Discrete variable extremum problems. Operations Research 5, 266–277
Garey, M.R., Johnson, D.S. [1978]: Strong NP-completeness results: motivation, examples, and implications. Journal of the ACM 25, 499–508
Gens, G.V., Levner, E.V. [1979]: Computational complexity of approximation algorithms for combinatorial problems. In: Mathematical Foundations of Computer Science; LNCS 74 (J. Becvar, ed.), Springer, Berlin, pp. 292–300
Ibarra, O.H., Kim, C.E. [1975]: Fast approximation algorithms for the knapsack and sum of subset problem. Journal of the ACM 22, 463–468
Kellerer, H., Pferschy, U. [2004]: Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal on Combinatorial Optimization 8, 5–11
Korte, B., Schrader, R. [1981]: On the existence of fast approximation schemes. In: Nonlinear Programming; Vol. 4 (O. Mangaserian, R.R. Meyer, S.M. Robinson, eds.), Academic Press, New York, pp. 415–437
Lawler, E.L. [1979]: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4, 339–356
Pisinger, D. [1999]: Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms 33, 1–14
Sahni, S. [1976]: Algorithms for scheduling independent tasks. Journal of the ACM 23, 114–127
Vygen, J. [1997]: The two-dimensional weighted median problem. Zeitschrift für Angewandte Mathematik und Mechanik 77, Supplement, S433–S436
Woeginger, G.J. [2000]: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing 12, 57–74
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). Il problema dello zaino. In: Ottimizzazione Combinatoria. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-1523-4_17
Download citation
DOI: https://doi.org/10.1007/978-88-470-1523-4_17
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)