wiki:AnnualReport2013

COIN-OR 2013 Annual Report

This wiki page constitutes the 2013 Annual Report of the COIN-OR Foundation and will remain available here as soft-copy. The annual report serves a couple of purposes. It provides a story to tell potential contributors, corporate partners, code contributors and users. Please add any information you'd like to share regarding your involvement in COIN-OR.

Introduction

COIN-OR (COmputational INfrastructure for Operations Research) was first announced at ISMP 2000 as an IBM initiative, hosted by IBM and seeded with seven projects produced by a handful of developers at IBM and collaborating academic institutions. In 2004 we became an independent organization, managed by the non-profit educational COIN-OR Foundation and hosted by INFORMS. In 2011 we outgrew our INFORMS hosting and now operate our own server located at Clemson. Today COIN-OR is the premier web site devoted to open-source software for the operations research community, home to 48 projects produced by 75 full members assisted by many more contributors, with a burgeoning community of users and developers comprised of more than 2,000 subscriptions from more than 1,000 unique e-mail addresses. We're proud of what we have become. More, we're proud of what we have produced as a community.

COIN-OR encourages new project contributions by providing an extensive set of tools and infrastructure support for collaborative project development. COIN-OR will continue to work with manufacturers of commercial software to develop interfaces to their products. With the help of a worldwide community of developers, we will continue to offer open-source software that meets the highest standards for state-of-the-art algorithms and industrial strength robustness and efficiency.

Reports from the SLB & TLC

  • Strategic Leadership Board (SLB): Kevin Furman, Lou Hafer (Secretary), William Hart, Randy Kiefer (Treasurer), Alan King, Ted Ralphs (TLC Rep), Paul Rubin, Matthew Saltzman (President).

Report from the President

This year, we have continued to make progress on building out our Web infrastructure, but not as rapidly as we would like. Some of the services we are in the process of rolling out are relatively complex to configure and manage; some of the rollouts themselves involve significant effort and can't easily be done piecemeal; and we have relied entirely on volunteer labor from busy people. We will be continuing this effort in 2014, with plans to migrate the Web pages to WordPress and to support Git repositories. Our financial position is such that we can maintain the current level of activity for several more years, but there is ongoing discussion on the SLB and TLC on whether and how best to grow and to continue to maintain the services we offer in the future. We welcome input from the membership on that topic.

Reports from SLB standing committees:

Finance (Randy Kiefer, chair)

The balance in the checkbook as of December 31, 2013 was $17,171.68. Notable expenses in 2013 included

+ $1,500 to replenish the server support account at Clemson.

+ $1,335 for expenses associated with the COIN-OR booth at the Minneapolis INFORMS meeting.

An additional $500 went towards legal requirements and maintaining COIN-OR's Internet presence.

Legal Affairs (Ted Ralphs, chair; Lou Hafer; Matt Saltzman)

To the relief of all concerned, the Legal Affairs Committee has seen no action this year.

Membership (Lou Hafer, chair)

Due to other commitments, the Membership Committee has not yet issued the usual Fall call for membership nominations. Don't wait for the Membership Committee to find time to notice someone's good work! Anyone can nominate an individual for full membership at any time. Check the Full Members list for instructions.

Outreach (Alan King, chair)

There has been no action by the Outreach Committee this year.

Web (Matt Saltzman, Bill Hart)

The Web Committee has made substantial progress towards a new COIN web site and hopes to complete the task within the next few months. Volunteers are always needed and welcome. Offers to work for pay will be considered based on qualifications and the needs of the web site team.

  • Technical Leadership Council (TLC): Matt Galati, Leo Lopes, Kipp Martin, Ted Ralphs (chair), Haroldo Gambini Santos, John Siirola, Stefan Vigerske

The TLC has seen much progress toward some of their eventual goals this year. First and most important, we have now releases CoinAll version 1.7.0! As part of the process of making the release, we further improved the build process so that the code base now builds "out of the box" on all major platforms. A major addition in this release is integration of Python support. We have gotten automated nightly builds and test up and running with [Jenkins https://jenkins.coin-or.org:8080] and have a small build farm that includes all major platforms. We have an automated process for producing installers and will soon be posting nightly installers, as well as installers for all major releases. We are working on getting COIN into the major Linux distributions and as part of MacPorts/Homebrew on OSX. All in all, things are looking good!

Elections

The SLB has decided to try a change in the way COIN holds its Annual General Meeting and elections for Directors. Starting this year, the Annual General Meeting and elections will be virtual and decoupled from the User's Meeting at INFORMS. The Directors hope that this will better serve the needs of a virtual organisation.

News and Announcements

Add your item in the list below (sorted in something vaguely approximating the order of the Projects list). Shameless self-promotion is strongly encouraged, whether you're a user of COIN-OR software or a developer of COIN-OR software.

  • Crème (Couenne Rèlaxation Method): a randomized thermal variant of the Agmon-Motzkin-Schoenberg relaxation method, developed to solve large instances of the Maximum Feasible Subsystem (MaxFS) problem, i.e., the problem of finding, given an infeasible system of linear inequalities, a feasible subsystem of maximum cardinality. The parallel MPI version will be open sourced soon. See the project page for more.
    • Pietro Belotti, pietrobelotti at fico dot com
  • Ipopt 3.11 has been released, which brings thread safety, support for new HSL solvers, an improved and easier to build Matlab interface, improvements in the Java interface, updated and reorganized documentation, and plenty bugfixes and small improvements (changelog)
  • Clp 1.15 has been released, including John Forrest' new experimental multithreaded simplex solver Aboca
  • Cgl 0.58 has been released, including three new cut generators: an implementation of zero-half cuts generator by Alberto Caprara, a new implementation of a reduce and split cut generator by Giacomo Nannicini, and an alternative robust implementation of a Gomory mixed-integer cuts separator
  • Cbc 2.8 has been released, including the new Cgl cut generators, an implementation of the proximity search heuristic, and possibilities to exploit multiple threads for the root node solve.
  • LEMON 1.3 has been released, featuring bipartite graphs, thread safe data structures, new algorithms (Edmonds-Karp, Nagamochi-Ibaraki, max. cardinality search, heuristics for the max clique and symmetric TSP), faster network flow implementations and various minor improvements.
  • SYMPHONY 5.5.0 has been released. It includes major enhancements to heuristics and preprocessing that resulted in improvements in overall performance.
  • Dip 0.9.0 has been releases. It now includes a completely generic decomposition-based MILP solver that can automatically detect structure and exploit multi-core architectures.
  • GiMPy 1.0.0 has been released! It is a Python graph class focused primarily on visualization.
  • GrUMPy 0.5.0 has been released! It is a collection of visualization routines for mathematical programs.
  • CoinAll 1.7.0 has been released!!!

Project List

All projects can be reached from the COIN-OR projects page.

  • ABACUS: A Branch-And-CUt System, an LP-based branch-and-cut framework.
    • Michael Juenger
  • ADOL-C: Automatic Differentiation by OverLoading in C++, facilitates the evaluation of first and higher derivatives of vector functions that are defined by computer programs written in C or C++.
    • Andrea Walther, andrea dot walther at uni-paderborn dot de
  • AIMMSlinks: AIMMS/COIN-OR Links, links between the modeling language AIMMS and solvers that are hosted at COIN-OR.
    • Marcel Hunting, marcel dot hunting at aimms dot com
  • BCP: Branch-Cut-Price Framework, is a parallel branch-cut-price framework.
    • Laszlo Ladanyi, ladanyi at us dot ibm dot com
  • Bonmin: Basic Open-source Nonlinear Mixed INteger programming, is an experimental C++ code for solving general mixed-integer nonlinear programming problems.
    • Pierre Bonami, pierre.bonami at lif dot univ-mrs dot fr
  • BuildTools: build and documentation support for COIN-OR projects.
    • Andreas Waechter, andreasw at watson dot ibm dot com
  • Cbc: COIN-OR Branch and Cut, a library for creating branch and cut algorithms; includes a standalone branch-and-cut executable.
    • Ted Ralphs, ted at lehigh dot edu
  • Cgc: COIN-OR Graph Classes, a collection of network representations and algorithms.
    • Phillip Walton, hpwalton at comcast.net
  • Cgl: Cut Generation Library, a collection of algorithms to generate cutting planes.
    • Robin Lougee, rlougee at us dot ibm dot com
  • CHiPPS: COIN-OR Open Parallel Search Framework.
    • Ted Ralphs, tkralphs at lehigh dot edu
  • Clp: COIN-OR LP, a linear program solver.
    • Julian Hall, jajhall at ed dot ac dot uk
  • CMPL: Coliop/Coin Mathematical Programming Language.
    • Mike Steglich mike.steglich at th-wildau dot de
  • CoinBazaar: The COIN-OR Bazaar, small examples and extensions of COIN-OR projects.
    • William Hart, wehart at sandia dot gov
  • CoinBinary: pre-compiled binary distributions of COIN-OR projects.
    • Ted Ralphs, ted at lehigh dot edu
    • The repository for CoinAll, an interoperable set of many of the COIN libraries conveniently collected in one place, is housed in the CoinBinary project.
  • CoinEasy: Provides guidelines for new users to COIN-OR to get up and running easily.
    • Kipp Martin, kmartin at chicagobooth dot edu
  • CoinMP: a Windows DLL solver with a C-API interface to COIN-OR LP, COIN-OR Branch and Cut, and the Cut Generation Library.
    • Bjarni Kristjansson, bjarni at maximalsoftware dot com
  • CoinUtils: COIN-OR utilities library.
    • Laszlo Ladanyi, ladanyi at us dot ibm dot com
  • Coopr: COmmon Optimization Python Repository, integrates a variety of Python optimization-related packages.
    • William Hart, wehart at sandia dot gov
  • Couenne: an exact solver for non-convex MINLP problems.
    • Pietro Belotti, pbelott at clemson dot edu
  • CppAD: a tool that computes derivatives of C++ algorithms.
    • Brad Bell, bradbell at seanet dot com
  • CSDP: library for semidefinite programming.
    • Brian Borchers borchers at nmt dot edu
  • DFO: Derivative-Free Optimization, a package for solving general nonlinear optimization problems when derivatives are unavailable.
    • Katya Scheinberg
  • DIP: Decomposition in Integer Programming, a framework for implementing a variety of decomposition-based branch-and-bound algorithms for solving mixed-integer linear programs.
    • Ted Ralphs, ted at lehigh dot edu
  • Djinni: a templatized C++ framework with Python bindings for heuristic search.
    • Justin C. Goodson, goodson at slu dot edu
  • DyLP: an implementation of the dynamic simplex algorithm.
    • Lou Hafer, lou at cs dot sfu dot ca
  • filterSD: subroutines for nonlinear optimization, a library for nonlinear optimization written in Fortran.
    • Frank E. Curtis, frank.e.curtis at lehigh dot edu
  • FLOPC++: an algebraic modeling language embedded in C++.
    • Tim Hultberg, tim dot hultberg at eumetsat dot int
  • GAMSlinks: links between GAMS and open source solvers.
    • Stefan Vigerske
  • IPOPT: an interior point algorithm for general large-scale nonlinear optimization.
    • Andreas Waechter, waechter at iems dot northwestern dot edu and Stefan Vigerske
  • LaGO: Lagrangian Global Optimizer, global optimization of nonconvex mixed-integer programs.
    • Stefan Vigerske
  • LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks.
    • Alpar Juttner, alpar at cs dot elte dot hu
  • METSlib: an object oriented metaheuristics optimization framework and toolkit in C++.
    • Mirko Maischberger, mirko dot maischberger at gmail dot com
  • MOCHA: Matroid Optimization: Combinatorial Heuristics and Algorithms, heuristics and algorithms for multicriteria matroid optimization.
    • David Haws, dchaws+MOCHA at gmail dot com
  • NLPAPI: Non-Linear Program Application Programming Interface, subroutine interface for defining and solving non-linear programming problems.
    • Michael Henderson
  • OBOE: Oracle Based Optimization Engine, optimization of convex problems with user-supplied methods delivering key first order information.
    • Nidhi Sawhney, nsawhney at gmail dot com
  • OptiML: Optimization for Machine Learning, interior point, active set method and parametric solvers for support vector machines, solver for the sparse inverse covariance problem.
    • Katya Scheinberg
  • OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services.
    • Kipp Martin, kipp.martin at chicagogsb dot edu, Horand Gassmann and Jun Ma
  • OSI: Open Solver Interface, a uniform subroutine interface for callable solver libraries.
    • Matthew Saltzman, mjs at clemson dot edu and Lou Hafer, lou at cs dot sfu dot ca
  • OTS: Open Tabu Search, a Java framework for creating tabu search algorithms.
    • Rob Harder
  • PFunc: Parallel Functions, a lightweight and portable library that provides C and C++ APIs to express task parallelism.
    • Prabhanjan Kambadur, pkambadu at osl dot iu dot edu
  • PuLP: Python library for modeling linear and integer programs.
    • Stuart Mitchell, s.mitchell at auckland dot ac dot nz
  • ROSE: Reformulation/Optimisation Software Engine, tools for automating mathematical programming reformulation.
    • David Savourey, savourey at lix dot polytechnique dot fr
  • SMI: Stochastic Modeling Interface, an interface for optimization under uncertainty.
    • Alan King, kingaj at us dot ibm dot com
  • SYMPHONY: a callable library for solving mixed-integer linear programs.
    • Ted Ralphs, tkralphs at lehigh dot edu
  • TestTools: Python scripts to automatically download, configure, build, test, install, build binaries, and distribute binaries.
    • JP Fasano
  • VOL: Volume Algorithm, a generalization of the subgradient method which produces approximate primal solutions as well as dual solutions.
    • Francisco Barahona, barahon at us dot ibm dot com
  • VRPH: VRP Heuristics, a library of heuristics for generating solutions to variants of the vehicle routing problem.
    • Chris Groer, cgroer at gmail dot com

The projects above reflect the interests of the individuals who have contributed to date. The volunteers running COIN-OR and its projects continually strive to improve overall quality, documentation, ease of use, and robustness. The level of success in achieving these goals depends on the support received from the community. New projects that reflect the broad interests and needs of the OR community, such as resources for visualization, data mining, simulation, constraint programming, statistics, forecasting, spreadsheets, and more, are welcome.

Last modified 6 years ago Last modified on Jan 30, 2014 10:55:56 AM