On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems (Q2932440)
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: On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems |
scientific article; zbMATH DE number 6375512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems |
scientific article; zbMATH DE number 6375512 |
Statements
On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems (English)
0 references
1 December 2014
0 references
precedence constraints
0 references
dynamic programming
0 references
computational complexity
0 references
sequential ordering problem
0 references
sheet cutting
0 references
0.8336105942726135
0 references
0.8211665749549866
0 references
0.8111711144447327
0 references
0.8050289154052734
0 references
