NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (Q4015406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 86016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM |
scientific article; zbMATH DE number 86016 |
Statements
NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (English)
0 references
11 February 1993
0 references
tight lower bounds
0 references
branch-and-bound
0 references
capacitated arc routing
0 references
0.9002853035926819
0 references
0.8844134211540222
0 references
0.8799909949302673
0 references
0.8697429895401001
0 references
0.8642211556434631
0 references
