Presentations of Juan Pablo Vielma

Presentations

• Mixed Integer Programming Models for Non-Separable Piecewise Linear Cost Functions.
  • INFORMS Annual Meeting, Washington, DC, October 2008.
  • Georgia Institute of Technology, ISyE DOS Optimization Seminars, Atlanta, Georgia, October 2008.
  • Department of Industrial Engineering, University of Pittsburg, Pittsburgh, Pennsylvania, December 2008.
  • School of Chemical and Biomolecular Engineering, Georgia Institute of Technology, Atlanta, Georgia, March 2009.


• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.
  • Georgia Institute of Technology, ISyE DOS Optimization Seminars, Atlanta, Georgia, April 2008.
  • 13th Conference on Integer Programming and Combinatorial Optimization, Bertinoro, Italy, May 2008.
  • Workshop on Mixed Integer Programming, New York, New York, August 2008 (Poster).
  • INFORMS Annual Meeting, Washington, DC, October 2008.


• A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs.
  • Georgia Institute of Technology, ISyE Integer Programming Seminars, Atlanta, Georgia, February 2007.
  • Workshop on Mixed Integer Programming, Montréal, Canada, July 2007 (Poster).
  • INFORMS Annual Meeting, Seattle, Washington, November 2007.
  • Optimization Society Student Paper Prize, INFORMS Annual Meeting, Seattle, Washington, November 2007.
  • INFORMS Optimization Society Annual Meeting, Atlanta, Georgia, March 2008.
  • Bellairs Workshop on Integer Programming, Holetown, Barbados, March 2008.
  • SIAM Conference on Optimization, Boston, Massachusetts, May 2008.
  • Universidad Adolfo Ibañez, Santiago, Chile, July 2008 (In Spanish).


• Economic and fragmentation effects of multiple adjacencies in the area restriction model.
  • INFORMS Annual Meeting, Seattle, Washington, November 2007.


• Polyhedral aspects of nonconvex, lower semicontinuous piecewise linear optimization.
  • INFORMS Annual Meeting, Pittsburgh, Pennsylvania, November 2006.


• GreenUp and adjacency issues in forest spatial harvesting.
  • INFORMS Annual Meeting, Pittsburgh, Pennsylvania, November 2006.


• A constructive characterization of the split closure of a mixed integer linear program.
  • Workshop on Mixed Integer Programming, Coral Gables, Florida, June 2006 (Poster).
  • 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, July 2006.
  • Georgia Institute of Technology, ISyE Integer Programming Seminars, Atlanta, Georgia, October 2006.
  • Georgia Institute of Technology, ACO Student Seminar, Atlanta, Georgia, November 2008.


• Comparing two formulations for the ARM problem.
  • 12th Symposium for Systems Analysis in Forest Resources, Burlington, Vermont, September 2006.


• Comparison of methodologies for limiting opening sizes in forest harvest scheduling.
  • INFORMS Annual Meeting, San Francisco, California, November 2005.


• Improved solution techniques for multi-period area-based forest harvest scheduling problems.
  • 38th Annual Conference of the Operational Research Society of New Zealand, Hamilton, New Zealand, November 2003.
  • V Chilean Operational Research Conference, Valparaiso, Chile, September 2003 (In Spanish).


• An exact algorithm for the area restriction model.
  • Symposium on Models and Systems in Forestry, Punta de Tralca, Chile, March 2002 (with Andres Weintraub).