Publications of Juan Pablo Vielma

Presentations

Encodings in Mixed Integer Linear Programming.
- Operations Research Center, MIT, Cambridge, MA, December 2012.
Incremental Formulations for SOS1 Variables.
- INFORMS Annual Meeting, Phoenix, AZ, October 2012.
Split Cuts for Convex Nonlinear Mixed Integer Programming.
- INFORMS Optimization Society Conference, Coral Gables, FL, February 2012.
- Integer Programming Workshop, Valparaiso, Chile, March 2012.
- 21st International Symposium on Mathematical Programming, Berlin, Germany, August 2012.
Challenges in Nonlinear Mixed Integer Programming Theory and Practice.
- Sloan School of Management, MIT, Cambridge, MA, February 2012.
Integer Programming Challenges in Sustainable Natural Resource Management.
- ORIE Colloquium, Cornell University, Ithaca, NY, January 2012.
Cutting planes and elementary closures for non-linear integer programming.
- DIMACS Interdisciplinary Series, Rutgers University, Piscataway, NJ, November 2011.
The Chvátal-Gomory closure of a compact convex body is a rational polytope.
- SIAM Conference on Optimization, Darmstadt, Germany, May 2011.
Robustness and recourse for the open-pit problem.
- Universidad de Antofagasta, Antofagasta, Chile, March, 2011 (In Spanish).
Integer programming approaches for imposing connectivity in forest management.
- 14th Symposium for Systems Analysis in Forest Resources (SSAFR 2010), Maitencillo, Chile, March, 2011 (Semi-Plenary).
The Chvátal-Gomory closure of a strictly convex body is a polyhedron.
- IP for Lunch, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, March 2010.
- Mixed Integer Programming Workshop, Atlanta, GA, July 2010.
- INFORMS Annual Meeting, Austin, TX, November 2010.
Risk control in ultimate pits using conditional simulations.
- 34th International Symposium on Application of Computers and Operations Research in The Mineral Industry, Vancouver, Canada, October 2009.
Imposing old-growth patch constraints in forest harvest scheduling models.
- Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, September 2009.
- INFORMS Annual Meeting, San Diego, CA, October 2009.
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, GA, October 2008.
- Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, December 2008.
- School of Chemical and Biomolecular Engineering, Georgia Institute of Technology, Atlanta, GA, March 2009.
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.
- Georgia Institute of Technology, ISyE DOS Optimization Seminars, Atlanta, GA, April 2008.
- 13th Conference on Integer Programming and Combinatorial Optimization, Bertinoro, Italy, May 2008.
- Workshop on Mixed Integer Programming, New York, NY, August 2008 (Poster).
- INFORMS Annual Meeting, Washington, DC, October 2008.
- 20th International Symposium on Mathematical Programming, Chicago, IL, August 2009.
A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs.
- Georgia Institute of Technology, ISyE Integer Programming Seminars, Atlanta, GA, February 2007.
- Workshop on Mixed Integer Programming, Montréal, Canada, July 2007 (Poster).
- INFORMS Annual Meeting, Seattle, WA, November 2007.
- Optimization Society Student Paper Prize, INFORMS Annual Meeting, Seattle, WA, November 2007.
- INFORMS Optimization Society Annual Meeting, Atlanta, GA, March 2008.
- Bellairs Workshop on Integer Programming, Holetown, Barbados, March 2008.
- SIAM Conference on Optimization, Boston, MA, 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, WA, November 2007.
Polyhedral aspects of nonconvex, lower semicontinuous piecewise linear optimization.
- INFORMS Annual Meeting, Pittsburgh, PA, November 2006.
GreenUp and adjacency issues in forest spatial harvesting.
- INFORMS Annual Meeting, Pittsburgh, PA, November 2006.
A constructive characterization of the split closure of a mixed integer linear program.
- Workshop on Mixed Integer Programming, Coral Gables, FL, June 2006 (Poster).
- 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, July 2006.
- Georgia Institute of Technology, ISyE Integer Programming Seminars, Atlanta, GA, October 2006.
- Georgia Institute of Technology, ACO Student Seminar, Atlanta, GA, November 2008.
Comparing two formulations for the ARM problem.
- 12th Symposium for Systems Analysis in Forest Resources, Burlington, VT, September 2006.
Comparison of methodologies for limiting opening sizes in forest harvest scheduling.
- INFORMS Annual Meeting, San Francisco, CA, 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).