1. Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)
2. Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, New Jersey (1982)
3. Bertsekas: Linear Network Optimization, Algorithms and Codes. MIT Press, Cambridge (1991)
4. Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimizations. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
5. Lecture Notes in Computer Science;J. Pérez,2003