A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420)
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: A decomposition-based heuristic for the multiple-product inventory-routing problem |
scientific article; zbMATH DE number 6650826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decomposition-based heuristic for the multiple-product inventory-routing problem |
scientific article; zbMATH DE number 6650826 |
Statements
A decomposition-based heuristic for the multiple-product inventory-routing problem (English)
0 references
10 November 2016
0 references
inventory-routing
0 references
heuristic
0 references
mixed-integer linear programming
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0.825049877166748
0 references
0.820008397102356
0 references
0.8198270201683044
0 references
0.8168794512748718
0 references
0.813180685043335
0 references
