Branch-and-Cut for the Maximum Feasible Subsystem Problem (Q3608970)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-Cut for the Maximum Feasible Subsystem Problem |
scientific article; zbMATH DE number 5523965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-Cut for the Maximum Feasible Subsystem Problem |
scientific article; zbMATH DE number 5523965 |
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
0.8355367183685303
0 references
0.8281973600387573
0 references
0.8271831274032593
0 references
