Presentations of Juan Pablo Vielma

Presentations

• Programacion no-lineal entera para problemas de optimizacion de portafolios (In Spanish). Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. Universidad Adolfo Ibañez. Santiago, Chile. July, 2008.


• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. Juan Pablo Vielma and George L. Nemhauser. 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008). Bertinoro, Italy. May, 2008.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. SIAM Conference on Optimization (SIAM OP08). Boston, Massachusetts. May, 2008.


• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. Juan Pablo Vielma and George L. Nemhauser. ISyE DOS Optimization Seminars. Atlanta, Georgia. April, 2008.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. Bellairs Workshop on Integer Programming (Bellairs 2008). Holetown, Barbados. March, 2008.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. INFORMS Optimization Society Annual Meeting (INFORMS OPT 2008). Atlanta, Georgia. March, 2008.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. INFORMS Optimization Society Student Paper Prize Talk. INFORMS Annual Meeting (INFORMS 2007). Seattle, Washington. November, 2007.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. INFORMS Annual Meeting (INFORMS 2007). Seattle, Washington. November, 2007.


• Economic and Fragmentation Effects of Multiple Adjacencies in the Area Restriction Model. Juan Pablo Vielma and Marcos Goycoolea. INFORMS Annual Meeting (INFORMS 2007). Seattle, Washington. November, 2007.


• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. ISyE Integer Programming Seminars. Atlanta, Georgia. February, 2007.


• Polyhedral Aspects of Nonconvex, Lower Semicontinuous Piecewise Linear Optimization. Juan Pablo Vielma, Ahmet B. Keha and George L. Nemhauser. INFORMS Annual Meeting (INFORMS 2006). Pittsburgh, Pennnsylvania. November, 2006.


• GreenUp and Adjacency Issues in Forest Spatial Harvesting. Marcos Goycoolea, Alan T. Murray, Juan Pablo Vielma and Andres Weintraub. INFORMS Annual Meeting (INFORMS 2006). Pittsburgh, Pennnsylvania. November, 2006.


• A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Juan Pablo Vielma. ISyE Integer Programming Seminars. Atlanta, Georgia. October, 2006.


• Comparing two formulations for the ARM problem. Marcos Goycoolea, Alan T. Murray, Juan Pablo Vielma and Andres Weintraub. 12th Symposium for Systems Analysis in Forest Resources (SSAFR'06). Burlington, Vermont. September, 2006.


• A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Juan Pablo Vielma. 19th International Symposium on Mathematical Programming (ISMP'06). Rio de Janeiro, Brazil. July, 2006.


• Solving difficult forestry problems with spatial adjacency. Andres Weintraub, Alan T. Murray, David M. Ryan, Marcos Goycoolea and Juan Pablo Vielma. 19th International Symposium on Mathematical Programming (ISMP'06). Rio de Janeiro, Brazil. July, 2006.


• Comparison of Methodologies for Limiting Opening Sizes in Forest Harvest Scheduling. Marcos Goycoolea, Alan T. Murray, Juan Pablo Vielma and Andres Weintraub. INFORMS Annual Meeting (INFORMS 2005). San Francisco, California. November, 2005.


• Solving the temporal area restriction model. Andres Weintraub, David M. Ryan and Juan Pablo Vielma. IFORS Triennial Hawaii 2005 (IFORS 2005). Honolulu, Hawaii. July, 2005.


• Improved solution techniques for multi-period area-based harvest scheduling problems. Juan Pablo Vielma, David M. Ryan, Alan T. Murray and Andres Weintraub. 10th Symposium for Systems Analysis in Forest Resources (SSAFR'03). Stevenson, Washington. December, 2003.


• Improved Solution Techniques for Multi-Period Area-Based Forest Harvest Scheduling Problems. David M. Ryan, Juan Pablo Vielma, Alan T. Murray and Andres Weintraub. 38th Annual Conference of the Operational Research Society of New Zealand (ORSNZ'03). Hamilton, New Zealand. November, 2003.


• Restricciones de volumen elasticas para un problema de planificacion forestal con restricciones de area en multiples periodos. Juan Pablo Vielma, Alan T. Murray, David M. Ryan and Andres Weintraub. V Chilean Operational Research Conference (OPTIMA'03). Valparaiso, Chile. September, 2003.


• Improved solution techniques for multi-period area-based forest harvest scheduling problems . Juan Pablo Vielma, David M. Ryan, Alan T. Murray and Andres Weintraub. 18th International Symposium on Mathematical Programming (ISMP'03). Copenhagen, Denmark. August, 2003.


• An exact algorithm for the area restriction model. Marcos Goycoolea, Juan Pablo Vielma, Alan T. Murray, Francisco Barahona, Rafael Epstein and Andres Weintraub. Symposium on Models and Systems in Forestry (Chile Forest 2002). Punta de Tralca, Chile. March, 2002.

Posters

• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs. Juan Pablo Vielma, Shabbir Ahmed and George L. Nemhauser. Workshop on Mixed Integer Programming (MIP 2007). Montr\'{e}al, Canada. July, 2007.


• A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Juan Pablo Vielma. Workshop on Mixed Integer Programming (MIP 2006). Coral Gables, Florida. June, 2006.