Solving partitioning-hub location-routing problem using DCA (Q2358847): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 16:59, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving partitioning-hub location-routing problem using DCA |
scientific article |
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
