Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449)
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 1563868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving large single allocation \(p\)-hub problems with two or three hubs |
scientific article; zbMATH DE number 1563868 |
Statements
Solving large single allocation \(p\)-hub problems with two or three hubs (English)
0 references
2 June 2002
0 references
location
0 references
allocation
0 references
linear programming
0 references
branch-and-bound
0 references
nodes
0 references
0 references
0 references
0 references
0 references
0 references
0.8734347820281982
0 references
0.8602454662322998
0 references
0.8440021872520447
0 references
0.8437574505805969
0 references
0.8405964374542236
0 references
