Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668)
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: Lower and upper bounds for the two-echelon capacitated location-routing problem |
scientific article; zbMATH DE number 6651779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for the two-echelon capacitated location-routing problem |
scientific article; zbMATH DE number 6651779 |
Statements
Lower and upper bounds for the two-echelon capacitated location-routing problem (English)
0 references
11 November 2016
0 references
two-echelon capacitated location routing problem
0 references
adaptive large neighbourhood search
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.8572025299072266
0 references
0.8389243483543396
0 references
0.8349131345748901
0 references
0.8348626494407654
0 references
