![]() |
Crème |
||
|
This page provides resources for Crème (Coin-OR Relaxation Method), an Open Source heuristic for solving Maximum Feasible Subsystem (MaxFS) problems. The MaxFS problem consists of finding, in an infeasible LP
a subset of inequalities of maximum cardinality admitting at least one feasible solution. Crème implements a variant of the classical Agmon-Motzkin-Schoenberg (AMS) relaxation method for solving systems of linear inequalities. It is distributed on Coin-OR under the Eclipse Public License (EPL). Resources
|