Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved (Q2564336)
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: Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved |
scientific article; zbMATH DE number 961950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved |
scientific article; zbMATH DE number 961950 |
Statements
Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved (English)
0 references
7 January 1997
0 references
multi-period inventory problem
0 references
branch-and-bound
0 references
dynamic programming
0 references
0.7926759719848633
0 references
0.7903273701667786
0 references
0.7759837508201599
0 references
0.7746996283531189
0 references
