Exact algorithms for a selective vehicle routing problem where the longest route is minimized (Q2840529)
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: Exact algorithms for a selective vehicle routing problem where the longest route is minimized |
scientific article; zbMATH DE number 6189803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for a selective vehicle routing problem where the longest route is minimized |
scientific article; zbMATH DE number 6189803 |
Statements
19 July 2013
0 references
combinatorial optimization
0 references
branch-and-cut
0 references
local branching
0 references
0 references
Exact algorithms for a selective vehicle routing problem where the longest route is minimized (English)
0 references
0.913026750087738
0 references
0.7685509920120239
0 references
0.7685509324073792
0 references
0.7651187181472778
0 references
0.7649128437042236
0 references
