An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

Published Online:https://doi.org/10.1287/ijoc.10.2.149

References

  • Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Aykin T. On “A Quadratic Integer Program for the Location Of Interacting Hub Facilities”. European Journal of Operations Research (1990) 46 409 411 CrossrefGoogle Scholar
  • Aykin T. Lagrangian Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem. European Journal of Operations Research (1994) 77 S1 S23 CrossrefGoogle Scholar
  • Aykin T. Networking Policies for Hub-and-Spoke Systems with Applications to the Air Transportation System. Transportation Science (1995) 29 3 199 221 LinkGoogle Scholar
  • Campbell J. F. Location-Allocation for Distribution Systems with Transshipments and Transportation Economies of Scale. Annals of Operations Research (1992) 40 77 99 CrossrefGoogle Scholar
  • Campbell J. F. Integer Programming Formulations of Discrete Hub Location Problems. European Journal of Operational Research (1994) 72 387 405 CrossrefGoogle Scholar
  • Campbell J. F. A Survey of Hub Location. Studies in Locational Analysis (1994) 6 31 49 Google Scholar
  • Campbell J. F. Hub Location and the p-Hub Median Problem. Operations Research (1996) 44 6 923 935 LinkGoogle Scholar
  • Ernst A. T. , Krishnamoorthy M. Efficient Algorithms for the Uncapacitated Single Allocation p-Hub Median Problem. Location Science (1996) 4 139 154 CrossrefGoogle Scholar
  • Ernst A. T. , Krishnamoorthy M. Exact and Heuristic Algorithms for the Uncapacitated Multiple Allocation p-Hub Median Problem. European Journal of Operations Research (1998) 104 1 100 112 CrossrefGoogle Scholar
  • Fotheringham A. S. A New Set of Spatial Interaction Models: The Theory of Competing Destinations. Environment and Planning A (1983) 15 36 CrossrefGoogle Scholar
  • Klincewicz J. G. Heuristics for the p-Hub Location Problem. European Journal of Operational Research (1991) 53 1 25 37 CrossrefGoogle Scholar
  • Klincewicz J. G. Avoiding Local Optima in the p-Hub Location Problem Using Tabu Search and Grasp. Annals of Operations Research (1992) 40 283 302 CrossrefGoogle Scholar
  • Klincewicz J. G. Dual Algorithms for the Uncapacitaed Hub Location Problem. Location Science (1996) 4 173 184 CrossrefGoogle Scholar
  • O'Kelly M. Activity Levels at Hub Facilities in Interacting Networks. Geographical Analysis (1986) 18 343 356 CrossrefGoogle Scholar
  • O'Kelly M. The Location of Interacting Hub Facilities. Transportation Science (1986) 20 92 106 LinkGoogle Scholar
  • O'Kelly M. A Quadratic Integer Program for the Location of Interacting Hub Facilities. European Journal of Operations Research (1987) 32 393 404 CrossrefGoogle Scholar
  • O'Kelly M. Hub Facility Location with Fixed Costs. Papers in Regional Science: The Journal of the RSAI (1992) 71 293 306 CrossrefGoogle Scholar
  • O'Kelly M. , Skorin-Kapov D. , Skorin-Kapov J. Lower Bounds for the Hub Location Problem. Management Science (1995) 41 4 713 721 LinkGoogle Scholar
  • Skorin-Kapov D. , Skorin-Kapov J. On Tabu Search for the Location of Interacting Hub Facilities. European Journal of Operations Research (1994) 73 502 509 CrossrefGoogle Scholar
  • Skorin-Kapov D. , Skorin-Kapov J. , O'Kelly M. Tight Linear Programming Relaxations of Uncapacitated p-Hub Median Problems. European Journal of Operations Research (1996) 94 582 593 CrossrefGoogle Scholar
  • Smith K. , Krishnamoorthy M. , Palaniswami M. On the Location of Interacting Hub Facilities: Neural Versus Traditional Approaches. Location Science (1996) 4 155 171 CrossrefGoogle 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.