An algorithm for solving the multi-period online fulfillment assignment problem (Q970031)
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: An algorithm for solving the multi-period online fulfillment assignment problem |
scientific article; zbMATH DE number 5705799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for solving the multi-period online fulfillment assignment problem |
scientific article; zbMATH DE number 5705799 |
Statements
An algorithm for solving the multi-period online fulfillment assignment problem (English)
0 references
8 May 2010
0 references
supply chain management
0 references
multi-period
0 references
facility location
0 references
dual sales channel
0 references
0 references
0.8169345259666443
0 references
0.7789765000343323
0 references
0.7642512917518616
0 references
0.7396344542503357
0 references
0.7349994778633118
0 references
