A Note on “The Latest Arrival Hub Location Problem”

Published Online:https://doi.org/10.1287/mnsc.1040.0312

References

  • Campbell J. F. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994) 72(2):387–405CrossrefGoogle Scholar
  • Ernst A. T., Hamacher H., Krishnamoorthy M., Woeginger G. Uncapacitated single and multiple allocation p-hub center problems. (2002) . Technical report, CSIRO Mathematical and Information Sciences, Australia.Google Scholar
  • Kara B. Y., Tansel B. C. On the single assignment p-hub center problem. Eur. J. Oper. Res. (2000) 125(3):648–655CrossrefGoogle Scholar
  • Kara B. Y., Tansel B. C. The latest arrival hub location problem. Management Sci. (2001) 47(10):1408–1420LinkGoogle Scholar
  • Kara B. Y., Tansel B. C. The single-assignment hub covering problem: Models and linearizations. J. Oper. Res. Soc. (2003) 54(1):59–64CrossrefGoogle Scholar
  • Wagner B. Model formulations for hub covering problems. (2004) . Technical report 3/04, Darmstadt University of Technology, Department of Business Administration, Darmstadt, Germany.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.