On the complexity of the car sequencing problem. (Q703239)
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 2125890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the car sequencing problem. |
scientific article; zbMATH DE number 2125890 |
Statements
On the complexity of the car sequencing problem. (English)
0 references
11 January 2005
0 references
Computational complexity
0 references
Sequencing/scheduling
0 references
Analysis of algorithms
0 references
Pseudo-polynomial algorithms
0 references
0 references
0.8051146268844604
0 references
0.7958916425704956
0 references
0.791592538356781
0 references
0.7772989869117737
0 references
0.7687660455703735
0 references
