Branch-and-Cut for the Maximum Feasible Subsystem Problem (Q3608970)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-Cut for the Maximum Feasible Subsystem Problem |
scientific article |
Statements
Branch-and-Cut for the Maximum Feasible Subsystem Problem (English)
0 references
6 March 2009
0 references
infeasible linear inequality system
0 references
irreducible infeasible subsystem (IIS)
0 references
maximum feasible subsystem problem
0 references
minimum IIS-cover
0 references
branch-and-cut
0 references
