A lower bound for the node, edge, and arc routing problem (Q340291)
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 lower bound for the node, edge, and arc routing problem |
scientific article; zbMATH DE number 6652547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the node, edge, and arc routing problem |
scientific article; zbMATH DE number 6652547 |
Statements
A lower bound for the node, edge, and arc routing problem (English)
0 references
14 November 2016
0 references
vehicle routing
0 references
node routing
0 references
arc routing
0 references
general routing
0 references
VRP
0 references
CARP
0 references
NEARP
0 references
MCGRP
0 references
bound
0 references
benchmark
0 references
experiment
0 references
0.8336837291717529
0 references
0.8234881162643433
0 references
0.8205133676528931
0 references
0.8180156946182251
0 references
0.8161119222640991
0 references
