Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343)
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 6487386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using dual feasible functions to construct fast lower bounds for routing and location problems |
scientific article; zbMATH DE number 6487386 |
Statements
Using dual feasible functions to construct fast lower bounds for routing and location problems (English)
0 references
30 September 2015
0 references
dual feasible functions
0 references
column generation
0 references
fast lower bounds
0 references
\(p\)-median
0 references
general routing
0 references
0 references
0 references
0 references
0.7456672191619873
0 references
0.7298995852470398
0 references
0.7273853421211243
0 references
0.7262049317359924
0 references
0.7134393453598022
0 references
