COIN-OR and Open-Source Events
INFORMS Annual Meeting 2006


Presentations, workshops, and user-group meetings on open-source software at the INFORMS Annual Meeting 2006.

The COIN-OR Members and User Group Meeting will be held Monday during lunch (12:30 - 1:30 PM) in a tdb location. The meeting announcement will appear in the official program.

To update the information on this page, send a note.


COIN-OR Exhibits: Sunday, November 5, 2006, through Wednesday, November 8, 2006

Coordinator: Robin Lougee-Heimer, IBM Research, robinlh@us.ibm.com
On-site Setup: Brian Borchers, New Mexico Tech, borchers@nmt.edu
Handouts: JP Fasano, IBM Research, fasano@us.ibm.com
Location: Conference Exhibit Area.

The COIN-OR Initiative will be in booth #114 in the conference Exhibit Area. Stop by to:
  • meet members of the community
  • learn more about the initaitve
  • ask questions
  • get assistance
  • download code
  • start your project on COIN-OR
  • become an associate member of the COIN-OR Foundation
(Active in COIN-OR? Attending the conference? Volunteer at the booth! A sign-up sheet will be available at the booth to coordinate hours.)


COIN-OR Members and Users Group Meeting: Monday, 12:30 - 1:30 PM.

Coordinator: Brady Hunsaker, Secretary, COIN-OR Foundation. secretary@coin-or.org
Location: Tbd. Will appear in printed program
Agenda: Report on progress and Open Q & A time. If you would like to talk or propose a discussion item, contact secretary@coin-or.org


COIN-OR Update to INFORMS Computer Society (ICS): ICS Business Meeting.

Coordinator: Lou Hafer, Membership Commitee Chair, COIN-OR Foundation. lou@cs.sfu.ca
Location: Tbd. Will appear in printed program
Agenda: In 2006, COIN-OR and ICS formed a strategic partnership to advance their mutual goals. At the ICS business meeting, COIN-OR will report on its activties in 2006 and plans for 2007.


Cluster: Open-Source Software: open source, open data, open standards

13 session cluster co-sponsored with INFORMS Computing Society
Chair: Robin Lougee-Heimer, IBM Research, robinlh@us.ibm.com


Session: Sunday Nov 05, 08:00 - 09:30

Title: Applications of the Nonlinear Optimization Software IPOPT I
Chair: Andreas Waechter, IBM Research, andreasw@watson.ibm.com

Session: Sunday Nov 05, 10:00 - 11:30

Title: Applications of the Nonlinear Optimization Software IPOPT II
Chair: Andreas Waechter, IBM Research, andreasw@watson.ibm.com

Session: Sunday Nov 05, 13:30 - 15:00

Title: Open-Source Optimization Packages for Engineering Design
Chair: William Hart, Sandia National Laboratories, wehart@sandia.gov

Session: Sunday Nov 05, 16:30 - 18:00

Title: New in COIN-OR
Chair: Brady Hunsaker, University of Pittsburgh, hunsaker@engr.pitt.edu

Session: Sunday Nov 05, 16:30 - 18:00

Title: Software for Semidefinite Programming
Chair: Brian Borchers, New Mexico Tech, borchers@nmt.edu

Talk #4: The Continuing Development of CSDP
Author: Brian Borchers,New Mexico Tech, borchers@nmt.edu
Abstract: CSDP is a subroutine library and stand-alone solver for semidefinite programming problems that has been under development since 1997. The software is now being made available as an open source project through the COIN-OR repository. The current status of CSDP and future development plans will be described. Computational results will also be presented.

Session: Monday Nov 06, 08:00 - 09:30

Title: Mixed-Integer Nonlinear Programming with COIN-OR
Chair: Francois Margot, Carnegie Mellon University, fmargot@andrew.cmu.edu

Session: Monday Nov 06, 10:00 - 11:30

Title: Open-Source Branch-and-Bound Solvers from Sandia National Laboratories
Chair: Cynthia Phillips, Sandia National Laboratories, caphill@sandia.gov

Session: Monday Nov 06, 13:30 - 15:00

Title: Cuts & Constraints
Chair: Lou Hafer, Simon Fraser University, lou@cs.sfu.ca

Session: Monday Nov 06, 13:30 -15:00

Title: Applications of Semidefinite Programming
Chair: Brian Borchers, New Mexico Tech, borchers@nmt.edu

Talk #4: An SDP-Based Branch and Bound Code for the Maximum Independent Set Problem Presenting
Author: Brian Borchers,New Mexico Tech, borchers@nmt.edu
Abstract: We present a branch and bound code for maximum independent set problems that uses semidefinite programming bounds. The SDP bound is much tighter than linear programming bounds and computational results show that this approach can outperform conventional integer linear programming approaches. Results are presented for several large instances arising from coding theory.

Session: Monday Nov 06, 16:30 - 18:00

Title: Open Source, Distributed Computing, and Operations Research
Chair: Jeff Linderoth, Lehigh University, jtl3@lehigh.edu

Session: Tuesday Nov 07, 08:00 - 09:30

Title: Open Source Modeling Tools
Chair: Leo Lopes, University of Arizona, leo@sie.arizona.edu

Session: Tuesday Nov 07, 10:00 - 11:30

Title: Easier to Use: Open-Source Software
Chair: Robin Lougee-Heimer, IBM Research, robinlh@us.ibm.com

Session: Tuesday Nov 07, 13:30 - 15:00

Title: Open-Source Application Programming Interfaces for Optimization I
Chair: Robert Fourer, Northwestern University, 4er@iems.northwestern.edu

Session: Tuesday Nov 07, 16:30 - 18:00

Title: Open Source in Teaching
Chair: John Chinnec, Carleton University, chinneck@sce.carleton.ca

Session: Wednesday Nov 08, 08:00 - 09:30

Title: Open-Source Application Programming Interfaces for Optimization II
Chair: Robert Fourer, Northwestern University, 4er@iems.northwestern.edu