Linear Programming with Inexact Data is NP‐Hard (Q4228409): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:06, 6 February 2024
scientific article; zbMATH DE number 1248417
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Programming with Inexact Data is NP‐Hard |
scientific article; zbMATH DE number 1248417 |
Statements
Linear Programming with Inexact Data is NP‐Hard (English)
0 references
2 February 1999
0 references
inexact data
0 references
NP-hard
0 references
