ISCI - Investigadores

Investigadores

José Rafael Correa

Nombre:	José Rafael Correa
Grado:	Ph. D en Investigación de Operaciones - Massachusetts Institute Technology (MIT), EE.UU.
Áreas de Investigación:	Desarrollos Metodológicos, Gestión de la Producción, Organización Industrial
Líneas de investigación:	Programación matemática, Investigación de operaciones con énfasis en optimización combinatorial, Economía y Teoría de Juegos, Logística y Sistemas de Transporte y Telecomunicaciones.
Nivel de estudios:	Ph.D. en Investigación de Operaciones - Massachusetts Institute of Technology. Ingeniero Civil Matemático - Universidad de Chile.
Jerarquía Académica:	Profesor Asociado al Departamento de Ingeniería Industrial, Universidad de Chile.
Tipo:	Investigadores Jóvenes
E-Mail:	jcorrea@dii.uchile.cl
Publicaciones:	Cominetti, R., Correa, J., Rothvoß, T., San Martín, J. (2010) Optimal Selection of Customers for a Last-Minute Offer. Operations Research, 58 (4), 878-888. Correa, J.R., Fernandes, C.J., Wakabayashi, Y. (2010) Approximating a Class of Combinatorial Problems with rational Objective Function. Springer and Mathematical Programming Society, 124, 255–269. Correa, J., Wagner, M. (2009) LP-Based Online Scheduling: From Single to Parallel Machines. Mathematical Programming: Series A and B, 119(1), 109-136. Cominetti, R., Correa, J.R., Stier-Moses, N. (2009) The Impact of Oligopolistic Competition in Networks. Operations Research, 57(6), 1421-1437. Correa, J.R. y Levin, A. (2009) Monotone Covering Problems With An Additional Covering Constraint. Mathematics of Operations Research, 34(1), 238-248. Correa, J., Matamala, M. (2008) Some Remarks About Factors of Graphs. Journal of Graph Theory, 57(4), 265–274. Correa, J., Bein, W., Han, X. (2008) A Fast Asymptotic Approximation Scheme for Bin Packing With Rejection. Theoretical Computer Science, 393(1-3), 14-22. Correa, J., Epstein, R. (2008) Bin Packing With Controllable Item Sizes. Information and Computation, 206(8), 1003-1016. Correa, J., Schulz, A. y Stier-Moses, N. (2008) A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games. Games and Economic Behavior, 64(2), 457-469. Correa, J.R. y Figueroa, N. (2008) On the Planner\'s Loss Due to Lack of Information in Bayesian Mechanism Design. Documentos de trabajo, 247, Centro de Economía Aplicada, Universidad de Chile. Correa, J., Fiorini, S., Stier-Moses N. (2007) A Note on the Precedence-Constrained Class Sequencing Problem. Discrete Applied Mathematics, 155(3), 257-259. Correa, J., Schulz, A., Stier-Moses, N. (2007) Fast, Fair and Efficient Flows in Networks. Operations Research, 55(2), 215–225. Correa, J., Goemans, M. X. (2007) Improved Bounds for Nonblocking 3-Stage Clos Networks. SIAM Journal on Computing, 37(3), 870–894. Cominetti, R., Correa, J., Stier-Mosses, N. (2006) Network Games with Atomic Players. En Bugliesi, M. (et al) (Eds.)Automata, Languages and Programming serie Lecture Notes in Computer Science, Springer Berlin, Heidelberg, 525-536. Correa, J.R. (2006) Resource Augmentation in Two-Dimensional Packing with Orthogonal Rotations. Operations Research Letters, 34(1), 85-93. Baïou, M. Correa, J.R. (2006) The Node-edge Weighted 2-edge Connected Subgraph Problem: Linear Relaxation, Facets and Separation. Discrete Optimization, 3(2), 123-135. Bansal, N. Correa, J.R. Kenyon, C. y Sviridenko, M. (2006) Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Mathematics of Operations Research, 31(1), 31-49. Correa, J.R. Fernandes, C. y Wakabayashi, Y. (2006) Approximating a Class of Combinatorial Problems With Rational Objective Function. Lecture Notes in Computer Science, 4059 (Algorithm Theory - SWAT 2006), 351-362. Álvarez, F. Correa, J.R. y Gajardo, P. (2005) Inner Estimation of the Eigenvalue Set and Exponential Series Solutions to Differential Inclusions. Journal of Convex Analysis, 12(1), 1-11. Correa, J.R. y Schulz, A. (2005) Single-Machine Scheduling With Precedence Constraints. Mathematics of Operations Research, 30(4), 1005-1021. Correa, J.R. Schulz, A. y Stier-Moses, N. (2004) Selfish Routing in Capacitated Networks. Mathematics of Operations Research, 29(4), 961-976. Cominetti, R. y Correa, J.R. (2001) Common-lines and Passenger Assignment in Congested Transit Networks. Transportation Science, 35(3), 250–267.

Dirección: Domeyko 2367, Santiago Centro, Chile

Teléfono: 562-26894429 / 562-26894403

E-Mail: contacto@sistemasdeingenieria.cl

El ISCI es una entidad inscrita en el Registro de Centros para la Realización de Actividades de Investigación o Desarrollo para fines de la Ley Nº 20.241, de Incentivo Tributario a la Inversión Privada en Investigación y Desarrollo