A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619)
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 7706743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new formulation and branch-and-cut method for single-allocation hub location problems |
scientific article; zbMATH DE number 7706743 |
Statements
A new formulation and branch-and-cut method for single-allocation hub location problems (English)
0 references
4 July 2023
0 references
hub location
0 references
single allocation
0 references
discrete optimization
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0.8494924306869507
0 references
0.8406562209129333
0 references
0.8397793173789978
0 references
0.8383267521858215
0 references
