A hub location problem in designing digital data service networks: Lagrangian relaxation approach

Location Science

Volumn 4, Issue 3, 1996, Pages 185-194

  Lee, Youngho ^a   Lim, Byung Ha ^b   Park, June S ^b  

^a US West Advanced Technologies   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Hub location; Lagrangian relaxation; Network topology design; Steiner tree

Indexed keywords

EID: 0141752096     PISSN: 09668349     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0966-8349(96)00009-5     Document Type: Article

References (9)

1. Campbell, J. F. (1994) Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387-405.
2. Chopra, S. (1989) On the spanning tree polyhedron. Operation Research Letters, 8, 25-29.
3. CPLEX Optimization, Inc. (1992) Using the CPLEX callable library and CPLEX mixed integer library.
4. Geoffrion, A. M. (1974) Lagrangian relaxation for integer programming. Mathemtical Programming Study, 2, 82-114.
5. Lee, Y., Lu, L., Qiu, Y. & Glover, F. (1994a) Strong formulation and cutting planes for designing digital data networks. Telecommunication Systems, 2, 261-274.
6. Lee, Y., Qiu, Y. & Ryan, J. (1994b) Branch-and-cut algorithm for a Steiner tree-star problem. Working Paper, Boulder, CO: US West Advanced Technologies.
7. Nemhauser, G., Savelsbergh, M. & Signismondi, G. (1994) MINTO: a mixed integer optimizer. Operations Research Letters, 15,47-58.
8. Park, J. S., Lim, B. H. & Lee, Y. (1995) An optimal algorithm for the generalized multi-assignment problem. Working Paper, Department of Management Services, The University of Iowa.
9. Park, J. S. & Pirkul, H. (1995) Optimal configuration of distributed information systems on value-added networks. Working Paper, Department of Management Sciences, The University of Iowa.