Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms

References

• Amiri A., Pirkul H. New formulation and relaxation to solve a concave-cost network flow problem. J. Oper. Res. Soc. (1997) 48(3):278–287Google Scholar
• Balakrishnan A., Altinkemer K. Using a hop-constrained model to generate alternative communication network designs. ORSA J. Comput. (1992) 4(2):192–205Link, Google Scholar
• Balakrishnan A., Graves S. C. A composite algorithm for a concave-cost network flow problem. Networks (1989) 19(2):175–202Crossref, Google Scholar
• Boland N., Krishnamoorthy M., Ernst A., Ebery J. Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. (2004) 155(3):638–653Crossref, Google Scholar
• Campbell J. F. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994) 72:387–405Crossref, Google Scholar
• Campbell J. F., Ernst A. T., Krishnamoorthy M., Hamacher H., Drezner Z. Hub location problems. Location Theory: Applications and Theory (2001) (Springer-Verlag, New York) 373–406Google Scholar
• Campbell J. F., Ernst A. T., Krishnamoorthy M. Hub arc location problems: Part I—Introduction and results. Management Sci. (2005) 51(10):1540–1555Link, Google Scholar
• Ernst A. T., Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. (1996) 4:139–154Crossref, Google Scholar
• Ernst A. T., Krishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. (1998a) 104(1):100–112Crossref, Google Scholar
• Ernst A. T., Krishnamoorthy M. An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. (1998b) 10(2):149–162Link, Google Scholar
• Gavish B. Topological design of computer communication networks—The overall design problem. Eur. J. Oper. Res. (1992) 58(2):149–172Crossref, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the 2-facility capacitated network loading problem. Oper. Res. (1995) 43(1):142–157Link, Google Scholar
• Minoux M. Network synthesis and optimum network design-problems—Models, solution methods and applications. Networks (1989) 19(3):313–360Crossref, Google Scholar
• Mirchandani P. Projections of the capacitated network loading problem. Eur. J. Oper. Res. (2000) 122(3):534–560Crossref, Google Scholar
• O’Kelly M. E. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32:393–404Crossref, Google Scholar