DIMACS Workshop on COIN-OR

July 17 - 20, 2006
DIMACS Center, Rutgers University, Piscataway, NJ

Organizers:

Jonathan Eckstein, Rutgers University, jeckstei@rutcor.rutgers.edu

Jeff Linderoth, Lehigh University, jtl3@lehigh.edu

Robin Lougee-Heimer, IBM Research, robinlh@us.ibm.com

Francois Margot, Carnegie Mellon University, fmargot@andrew.cmu.edu

This meeting is jointly sponsored by the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), and IBM Research.

Slides:

• Brian Borchers, New Mexico Tech
  The Ongoing Development of CSDP

• Jonathan Eckstein, Rutgers University
  Overview of the PEBBL and PICO Projects:
  Massively Parallel Branch and Bound

• John Forrest, IBM
  Coin LP: A Tutorial

  Coin Branch and Cut: A Tutorial

• Lou Hafer, Simon Fraser University
  Tightening 'Big M' Constraints

• Michael Henderson, IBM Research
  NLPAPI - an API for Nonlinear Programming Problems

• Jun Ma, Northwestern University
  Optimization Services

• Jun Ma, Bob Fourer, Northwestern University and Kipp Martin, University of Chicago
  An Open Interface for Hooking Solvers to Modeling Systems

  An Open Interface for Hooking Solvers to Modeling Systems - Part 2

• Laszlo Ladanyi, IBM and Francois Margot, Carnegie Mellon University
  Introduction to BCP - MCF Example

• Stephen Nash, U.S. National Science Foundation
  Cyberinfrastructure: Initiatives at the US National Science Foundation

• Matthew Saltzman, Clemson University
  The COIN-OR Open Solver Interface

Previous: Workshop Index

Workshop Index

DIMACS Homepage