Solving partitioning-hub location-routing problem using DCA (Q2358847)
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 6732031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving partitioning-hub location-routing problem using DCA |
scientific article; zbMATH DE number 6732031 |
Statements
Solving partitioning-hub location-routing problem using DCA (English)
0 references
16 June 2017
0 references
hub location
0 references
DC programming
0 references
DC algorithm (DCA)
0 references
exact penalty
0 references
binary integer linear programming (BILP)
0 references
0.8655657172203064
0 references
0.7667890787124634
0 references
0.7480868697166443
0 references
0.7444893717765808
0 references
