This meeting is jointly sponsored by the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), and IBM Research.
Monday, July 17, 2006 Welcome & Using COIN-OR Day 8:45 - 9:30 Breakfast and Registration 9:30 - 9:45 Welcome and Opening Remarks Mel Janowitz, DIMACS Associate Director Jeff Linderoth, Lehigh University and Jon Lee, IBM Research 9:45 - 10:00 COIN-OR: The Computational Infrastructure for Operations Research Robin Lougee-Heimer, IBM Research 10:00 - 11:30 Getting & Building COIN-OR JP Fasano, IBM 11:30 - 12:30 Lunch 12:30 - 1:00 OSI: The Open Solver Interface Matthew Saltzman, Clemson University 1:00 - 1:30 NLPAPI: A Subroutine Interface to Nonlinear Programming Problems Mike Henderson, IBM 1:30 - 2:00 SMI: Stochastic Modeling Interface for COIN-OR Alan King, IBM 2:00 - 2:30 Break 2:30 - 5:00 Tutorial: COIN-OR LP Solver (CLP) John Forrest, IBM Tutorial: IPOPT Andreas Waechter, IBM 5:00 - 6:00 Reception Tuesday, July 18, 2006 Research Day 8:30 - 9:00 Breakfast and Registration 9:00 - 10:00 Mixed-Integer Rounding Inequalities for COIN-OR Joao Goncalves, IBM Research 9:30 - 10:00 Tightening `Big M' Disjunctions Lou Hafer, Simon Fraser University 10:00 - 10:30 Break 10:30 - 11:00 Overview of the PEBBL and PICO Projects: Massively Parallel Branch and Bound Jonathan Eckstein, Rutgers University 11:00 - 11:30 Experience with CGL in the PICO Mixed-integer Programming Solver Cindy Phillips, Sandia National Laboratories 11:30 - 12:00 Optimizing PICO's CLP Interface Ojas Parekh, Emory University 12:00 - 1:00 Lunch 1:00 - 1:30 Branch-and-Bound Algorithms for Solving the Quadratic Assignment Peter Hahn, University of Pennsylvania 1:30 - 2:00 Automated Tuning of Solver Parameters Brady Hunsaker, University of Pittsburgh 2:00 - 2:30 Break 2:30 - 5:00 Tutorial: COIN-OR Branch and Cut (CBC) John Forrest, IBM Tutorial: Branch-Cut-Price (BCP) Framework Laszlo Ladanyi, IBM and Francois Margot, Carnegie Mellon University 5:00 - 5:30 travel to restaurant 5:30 - 9:00 Conference Dinner at Seven Hills Wednesday, July 19, 2006 COIN-OR Projects Day 8:30 - 9:00 Breakfast and Registration 9:00 - 9:30 An Introduction by Example to Algorithmic Differentiation Brad Bell, University of Washington 9:30 - 10:00 The Ongoing Development of CSDP Brian Borchers, New Mexico Tech 10:00 - 10:30 Break 10:30 - 12:00 An Open Interface for Hooking Solvers to Modeling Systems Jun Ma, Northwestern University Bob Fourer, Northwestern University Kipp Martin, University of Chicago 12:00 - 1:00 Lunch 1:00 - 1:30 Modeling with COIN-OR Tools Leo Lopes, University of Arizona 1:30 - 2:00 Building a Tabu Search with the Java Engine OpenTS Rob Harder, USAF 2:00 - 2:30 CoinMP: Simple C-API Windows DLL implementation of CLP, CBC, and CGL Bjarni Kristjansson, Maximal Software 2:30 - 3:00 Break 3:00 - 5:30 Tutorial: Bonmin Pierre Bonami, Carnegie Mellon University Tutorial: Symphony Ted Ralphs, Lehigh University 5:30 - 6:30 Panel: "Whine & Cheese" -- Open Issues Francois Margot, moderator Thursday, July 20, 2006 Future Day 8:30 - 9:00 Breakfast and Registration 9:00 - 9:30 Challenges and Opportunities Generated by the Increasing Importance of Optimization in Supply Chain Management Chih-Hui Chang, IBM 9:30 - 10:15 Panel: COIN-OR in Industry John Tomlin, Yahoo, moderator 10:15 - 10:30 Break 10:30 - 11:00 Cyber infrastructure: Initiatives at the National Science Foundation Stephen Nash, George Mason University 11:00 - 11:45 Panel: The Future of COIN-OR Mike Trick, Carniegie Mellon University, moderator 11:45 - 12:00 Closing Remarks Jeff Linderoth, Lehigh University