The robot sequencing problem: polynomial algorithm and complexity (Q3713849)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3941252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The robot sequencing problem: polynomial algorithm and complexity |
scientific article; zbMATH DE number 3941252 |
Statements
The robot sequencing problem: polynomial algorithm and complexity (English)
0 references
1985
0 references
directed graphs
0 references
vertex packing problem
0 references
sequencing robot activities
0 references
precedence constraints
0 references
NP-hard
0 references
special case
0 references
polynomial-time algorithm
0 references
0.7920363545417786
0 references
0.7848555445671082
0 references
0.7829077243804932
0 references
