| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 481067 | European Journal of Operational Research | 2010 | 5 Pages |
Abstract
In this paper a well-known formulation for the capacitated single-allocation hub location problem is revisited. An example is presented showing that for some instances this formulation is incomplete. The reasons for the incompleteness are identified leading to the inclusion of an additional set of constraints. Computational experiments are performed showing that the new constraints also help to decrease the computational time required to solve the problem optimally.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Isabel Correia, Stefan Nickel, Francisco Saldanha-da-Gama,