New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700)
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: New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem |
scientific article; zbMATH DE number 6119335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem |
scientific article; zbMATH DE number 6119335 |
Statements
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (English)
0 references
29 December 2012
0 references
hub location
0 references
discrete location
0 references
integer programming
0 references
0 references
0 references
0 references
0 references
