The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542)
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: The complexity and approximability of finding maximum feasible subsystems of linear relations |
scientific article; zbMATH DE number 1065143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity and approximability of finding maximum feasible subsystems of linear relations |
scientific article; zbMATH DE number 1065143 |
Statements
The complexity and approximability of finding maximum feasible subsystems of linear relations (English)
0 references
29 September 1997
0 references
maximum feasible subsystem
0 references
0 references
0.8384808897972107
0 references
0.7640372514724731
0 references
0.7593584060668945
0 references
