NP-completeness of some optimal sequencing problems with a given grouping of elements (Q4723552)
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: NP-completeness of some optimal sequencing problems with a given grouping of elements |
scientific article; zbMATH DE number 3995427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of some optimal sequencing problems with a given grouping of elements |
scientific article; zbMATH DE number 3995427 |
Statements
NP-completeness of some optimal sequencing problems with a given grouping of elements (English)
0 references
1985
0 references
sequencing
0 references
permutation
0 references
NP-hard
0 references
0.8606379
0 references
0.85506773
0 references
0.8520615
0 references
0.8508915
0 references
0.84886986
0 references
0.8469906
0 references
0.84527075
0 references
0.84461606
0 references
