A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269)
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 5675910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem |
scientific article; zbMATH DE number 5675910 |
Statements
A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (English)
0 references
1 March 2010
0 references
complexity of computation
0 references
combinatorial optimization
0 references
\(N\)-vehicle problem
0 references
permutations
0 references
inverse order
0 references
0 references
0.7531173229217529
0 references
0.7125638723373413
0 references
0.6894019842147827
0 references
