A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms (Q3703591)
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: A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms |
scientific article; zbMATH DE number 3930727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms |
scientific article; zbMATH DE number 3930727 |
Statements
A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms (English)
0 references
1985
0 references
NP-hard mixed programming
0 references
polynomial approximate algorithms
0 references
greedy version
0 references
