Highly Influenced

# A branch and cut algorithm for hub location problems with single assignment

@article{Labb2005ABA, title={A branch and cut algorithm for hub location problems with single assignment}, author={Martine Labb{\'e} and Hande Yaman and {\'E}ric Gourdin}, journal={Math. Program.}, year={2005}, volume={102}, pages={371-405} }

- Published 2005 in Math. Program.
DOI:10.1007/s10107-004-0531-x

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results. keywords hub location, polyhedral… CONTINUE READING

#### From This Paper

##### Topics from this paper.

54 Citations

27 References

Similar Papers