Algorithmic research on the supply chain scheduling problem with optional path and transportation mode (Q4901809)
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: Algorithmic research on the supply chain scheduling problem with optional path and transportation mode |
scientific article; zbMATH DE number 6130226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic research on the supply chain scheduling problem with optional path and transportation mode |
scientific article; zbMATH DE number 6130226 |
Statements
24 January 2013
0 references
scheduling
0 references
supply chain
0 references
distribution
0 references
batching
0 references
polynomial time algorithm
0 references
0.8596284985542297
0 references
0.8367239236831665
0 references
0.8116947412490845
0 references
0.8104301691055298
0 references
