The robot sequencing problem: polynomial algorithm and complexity (Q3713849): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331938508843054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029427333 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity of Discrete Optimization Problems / rank | |||
Normal rank | |||
Latest revision as of 13:07, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The robot sequencing problem: polynomial algorithm and complexity |
scientific article |
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
