07 Nov

2016 COIN-OR Cup Competition, Deadline Extended to October 14

Announcing the twelfth annual “COIN-OR Cup” competition, sponsored by the COIN-OR Foundation.

* A submission or nomination must contain:
1. a synopsis of an effective use of COIN-OR or valuable contribution to COIN-OR (or both!),
2. an explanation of its significance.

* The winner must accept the prize in person at the 2016 INFORMS Annual Meeting so we can all celebrate appropriately (see “Celebration” below).

* Submission deadline: Friday, October 14th, 2016.

* Self-nominations are welcome.

* We especially encourage nominations of effective use of COIN-OR that the community may not know about.

Celebration: The 2016 COIN-OR Cup will be awarded at a celebration during the INFORMS Annual meeting in Nashville, TN. All entrants, their supporters, and other interested parties are welcome to join the celebration and regale, rile, and roast the prize winners. The celebration will take place Monday, November 14, 7:30 pm at the Flying Saucer, 111 10th Ave. S. 310, Nashville TN 37203. Details of the
winning entry will be announced at this celebration event, and posted on the COIN-OR Cup website. Please e-mail your submissions to coin-cup@

Details of the winning entry will be announced at this celebration event, and posted on the COIN-OR Cup website
Please e-mail your submissions to coin-cup at coin-or.org.

2016 COIN-OR Cup Committee:
Stefan Wild (chair), Argonne National Laboratory
Joey Huchette, Massachusetts Institute of Technology
Jeffrey Linderoth, University of Wisconsin-Madison
Miles Lubin, Massachusetts Institute of Technology

07 Nov

RBFOpt – A New Library for Black-box Optimization

RBFOpt is a library written in Python for black-box (also known as derivative-free) optimization. It is a global solver that requires zero-order information – just function values, not even gradients! RBFOpt is aimed at finding the global minimum in a small number of function evaluations, which is particularly useful when each function evaluation requires an expensive computation, e.g. a time-consuming computer simulation.

03 Nov

COIN-OR Pioneers Win 2014 INFORMS Impact Prize Award

The INFORMS Impact Prize recognises an individual or team whose contributions have had a widespread impact on the practice of operations research. With great pride, the COIN-OR Strategic Leadership Board extends its congratulations to nine of the pioneers of COIN-OR, Brenda Dietrich, JP Fasano, Lou Hafer, John Forrest, Brady Hunsaker, Laszlo Ladanyi, Robin Lougee, Ted Ralphs, and Matthew Saltzman, the recipients of the 2014 INFORMS Impact Prize.

In its citation, the Impact Prize Award Committee writes: The Computational Infrastructure for Operations Research (COIN-OR) is an initiative to spur the development of open-source software for the operations research community in order to accelerate the adoption and the evolution of computational operations research. COIN-OR provides development tools, distribution, standards, licensing information, and other infrastructure needed to facilitate and nurture open, community-driven software.

The COIN-OR initiative was launched at the 2000 International Symposium on Mathematical Programming as a three-year experiment by IBM Research. In 2004, a dedicated nonprofit corporation was formed to take over the successful and growing initiative. In the fourteen years of its existence, COIN-OR has grown from its initial offerings of four software projects, to more than fifty projects spanning much of computational operations research. COIN-OR has influenced every aspect of operations research: research, practice, education, community, and outreach.

Software supported by COIN-OR has been an essential part of hundreds of peer-reviewed research papers and is embedded in dozens of software systems, including the most widely used environments for performing analytics in practice. People use COIN-OR software every day to implement advanced operations research solutions to important problems. Through its on-line, in-person, and print activities, COIN-OR has been educating the operations research world about OR software and the potential of open source.

Thousands of people have been involved with COIN-OR; over 1400 people subscribe to one or more COIN-OR mailing lists today. COIN-OR is the result of the collaboration of many people over many years, but there are key individuals whose significant early contributions and leadership distinguish them. We recognize the individuals who launched COIN-OR at IBM Research, where the initiative was conceived and grew over the first four years to a successful community repository, and the individuals who incorporated the non-profit COIN-OR Foundation, Inc., where the initiative has thrived and continues to grow today. For their pivotal role in the creation and wide-spread adoption of COIN-OR, INFORMS is pleased to award the 2014 Impact Prize to Brenda Dietrich, JP Fasano, John Forrest, Lou Hafer, Brady Hunsaker, Laszlo Ladanyi, Robin Lougee, Ted Ralphs, and Matthew Saltzman.

The INFORMS Impact Prize recognises nine individuals. Without diminishing the well-deserved recognition given to the recipients, the Board would also like to extend its congratulations to all the members of the COIN-OR community. The COIN-OR initiative would not have been so successful without all those individuals who have contributed their time, expertise and software to support our endeavors, and all those users who have spurred us on to greater effort with their valuable feedback. The Board takes this opportunity to recognise the accomplishments of our community over the past decade. We look forward to the accomplishments we know will come in the future.

11 Mar

Stochastic Modeling Interface Enhancements

The Smi (Stochastic Modeling Interface) has the capability to assemble stochastic linear programs based on scenario trees. Alan King announced that quadratic programming has recently been added to the Smi capabilities. The current stable version 0.94 includes interfaces for constructing a quadratic stochastic program using the core problem / stochastic data paradigm. The unit test contains a use case.

14 May

OpenOffice 3.4.0 Uses COIN-OR Tools

The Apache Software Foundation (ASF) has announced availability of OpenOffice version 3.4.0. Among its new features: The linear programming solver in the Calc spreadsheet program has been replaced with COIN-OR tools. The spreadsheet uses the CoinMP API, which in turn uses the COIN-OR Branch and Cut MIP solver (CBC) and the COIN-OR Linear Programming solver (CLP) as solver engines, the Open Solver Interface (OSI), the Cut Generator Library (CGL) and the CoinUtils utility library.

29 Sep


David Savourey and Leo Liberti announced the new ROSE (Reformulation/Optimization Software Engine) project.  ROSE is an automatic reformulation software for mathematical programs. ROSE works either stand-alone (mostly for debugging purposes) or as an AMPL solver. As AMPL is very much closed-source and has no facilities for editing a “structured formulation” (i.e. a formulation involving indices and quantifiers) in memory, ROSE writes its output (usually a reformulated version of the mathematical programming formulation given in input) as a text file. This may be an input to further processing software (such as a numerical solver), or a “flat formulation” (i.e. a formulation without indices where all the parameter symbols have been replaced by numerical data) again in AMPL format. More information can be found on the ROSE project page.

08 Jun

Announcing CMPL

Mike Steglich and Thomas Schleiff announced CMPL. CMPL is a mathematical programming language and a system for modelling, solving and analyzing linear programming (LP) problems and mixed integer programming (MIP) problems. The CMPL syntax is similar in formulation to the original mathematical model but also includes syntactic elements from modern programming languages. CMPL uses the COIN-OR OSSolverService to solve LP and MIP problems. For more information, please visit the CMPL project page.

07 Apr

IPOPT Wins the Wilkinson Prize for Numerical Software

The 2011 Wilkinson Prize for Numerical Software will be awarded to Andreas Waechter (IBM T. J.  Watson Research Center) and Carl Laird (Texas A&M University) for IPOPT, a software library for solving nonlinear, nonconvex, large-scale continuous optimization problems. The presentation of the award will take place at the International Congress on Industrial and Applied Mathematics (ICIAM 2011) in Vancouver, BC, Canada.