A quadratic integer program for the location of interacting hub facilities (Q1092794): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 431 / rank | |||
Normal rank | |||
Revision as of 21:01, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quadratic integer program for the location of interacting hub facilities |
scientific article |
Statements
A quadratic integer program for the location of interacting hub facilities (English)
0 references
1987
0 references
This paper reports a new formulation of a general hub location model as a quadratic integer program. Non-convexity of the objective function makes the problem difficult. A variety of alternative solution strategies are discussed. Computational results from two simple heuristics are presented for the task of siting 2, 3 or 4 hubs to serve interactions between sets of 10, 15, 20 and 25 U.S. cities. The effects of different computational shortcuts are examined.
0 references
spatial interaction
0 references
general hub location
0 references
