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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 54 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Hub Lo ationProblems

  • J. F. Campbell, A. T. Ernst, M. Krishnamoorthy
  • 2002

Hub Location Problems

  • J. F. Campbell, A. T. Ernst, M. Krishnamoorthy
  • Facility Location : Applications and Theory
  • 2002

Hub Location Problems. In Facility Location: Applications and Theory, Z.Drezner and H.W

  • J. F. Campbell, A. T. Ernst, M. Krishnamoorthy
  • 2002

Similar Papers

Loading similar papers…