COIN-OR: Open-source software for Operations Research

MOPTA 2005

COIN-OR Open Solver Interface

¡A uniform API for calling math programming solvers

¡Supports functions such as

lCreating the LP formulation;

lDirectly modifying the formulation by adding rows/columns;

lModifying the formulation by adding cutting planes provided by CGL;

lSolving the formulation (and resolving after modifications);

lExtracting solution information;

lInvoking the underlying solver's branch-and-bound component.

¡11 OSI interfaces have been implemented

lCLP - John Forest

lCPLEX - Tobias Achterberg

ldylp - Lou Hafer

lFortMP – Patrick Valente

lGLPK - Brady Hunsaker

lMOSEK – Bo Jensen

lOSL - Laszlo Ladanyi

lSOPLEX – Tobias Achterberg

lSYMPHONY - Menal Guzelsoy

lVOL – Laszlo Ladanyi

lXPRESS-MP – Matthew Saltzman

¡Matt Saltzman, Meta-project Manager


	Matt Saltzman: XPRESS-MP
	Tobias Achterberg: CPLEX
	Lou Hafer: dylp
	Patrick Valente: FortMP
	Brady Hunsaker: OSI-GLPK
	Laci & Reka: OSL
	Menal Guzelsoy: SYMPHONY
	<Bo Jensen: Mosek (no picture, yet)>

	Users
	Brady Hunsaker, U of Pgh: Together with a collaborator at Georgia Tech, I use OSI for an NSF-funded (DMII OR) research project on using software to automate the search for valid inequalities of low Chvatal-Gomory rank. We are creating an open-source tool that will be usable with any OSI solver.
	(as Reka points out…”you too, could implement one of these!”)