Desarrollo de Indicadores de Casos Aplicables a la Selección de Algoritmos en el Problema 2–Partition
Development of Instance Indicators Applicable to Algorithm Selection for the 2–Partition Problem
Graduated: Jorge A. Ruiz–Vanoye
Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)
jruizvanoye@yahoo.com.mx , http://www.ruizvanoye.com
Advisor: Joaquín Pérez Ortega ]]>
Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)
jpocenidet@yahoo.com.mx
Advisor: Rodolfo A. Pazos Rangel
Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)
r_pazos_r@yahoo.com.mx
Graduated on Nov. 26, 2008.
Resumen
En este trabajo se abordó el problema de transformar instancias e indicadores de complejidad entre los problemas Bin–Packing y 2–Partition. Diversos investigadores han realizado reducciones y transformaciones polinomiales entre problemas NP–completos, los principales son Garey & Johnson, Karp y Cook. La transformación de 2–Partition a Bin–Packing existe en la literatura. Sin embargo no existe la transformación de Bin–Packing a 2–Partition, ni la transformación de indicadores con el fin de ser usados en la selección de algoritmos que mejor resuelven una instancia del problema 2–Partition. En esta tesis se propone un nuevo enfoque de solución para transformar instancias, desarrollar indicadores de complejidad y solución de los problemas Bin–Packing al problema 2–Partition, mediante una metodología y el desarrollo de lenguajes formales para expresar las instancias de ambos problemas.
]]> Palabras Claves: Transformación polinomial, lenguajes formales de instancias, compiladores, NP–Completo, selección de algoritmos.
Abstract
In this work we approach the problem of transforming instances and complexity indicators between the problems discovered being Bin–Packing and 2–Partition. Several researchers have reductions and polynomial transformations between NP–complete problems, the main ones Garey & Johnson, Karp and Cook. The transformation of 2–Partition into Bin–Packing exists in literature. Nevertheless, does not exist the transformation of Bin–Packing into 2–Partition, nor the transformation of indicators with the purpose of to be used in the selection of algorithms that better solves an instance of the 2–Partition problem. In this thesis a new approach of solution is proposed to transform instances, to develop complexity indicators and to solve the Bin–Packing problem to the 2–Partition problem, by means of a methodology and formal languages to express the instances of both problems.
Keywords: Polynomial transformation, formal languages of instances, compilers, NP–Complete, algorithm selection.
DESCARGAR ARTÍCULO EN FORMATO PDF
Referencias
1. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons. England (1991) 221–239. [ Links ]
2. Cook, S.A. The Complexity of Theorem Proving Procedures. Proc. 3rd ACM Symposium on Theory of Computing. Shaker Heights, Ohio (1971) 151–158. [ Links ]
3. Karp, R.M.: Reducibility Among Combinatorial Problems. In: Complexity of Computer Computations. R.E. Miller and J.W. Thatcher, Eds. Plenum Press, New York (1972) 85–104. [ Links ]
4. Hartmanis, J., Hopcroft, J.E.: An Overview of the Theory of Computational Complexity. Journal of the Association for Computing Machinery. Vol. 18, No. 3 (1971) 444–475. [ Links ]
5. 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). [ Links ]
6. Cormen, H.T., Charles, E.: Introduction to Algorithms. Second Edition. MIT Press (2001). [ Links ]
7. Papadimitriou, C.H.: Computational Complexity. Addison–Wesley (1994). [ Links ]
8. Sipser, M.: Introduction to the Theory of Computation. Thomson Course Technology (2006). [ Links ] ]]>