Survivable capacitated network design problem: New formulation and lagrangean relaxation

Journal of the Operational Research Society

Volumn 51, Issue 5, 2000, Pages 574-582

  Rios M ^a   Marianov, V ^a   Gutierrez, M ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

Capacity assignment; Disjoint paths; Lagrangean relaxation; Survivable network

Indexed keywords

CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; RELAXATION PROCESSES; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

LAGRANGEAN RELAXATIONS; LINEAR MIXED-INTEGER MATHEMATICAL PROGRAMMING; SURVIVABLE CAPACITATED NETWORKS;

OPERATIONS RESEARCH;

EID: 0342472173     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600913     Document Type: Article

References (10)

1. Cruz F, MacGregor Smith J and Mateus G (1998). Solving to optimality the uncapacitated fixed-charge network flow problem. Comput and Ops Res 25: 67-81.
2. Alevras D, Grotschel M and WessAly R (1997). Capacity and Survivability Models for Telecommunications Networks. Technical Report SC-97-24, Konrad-Zuse-Zentrum, Berlin.
3. Minoux M (1981). Optimum synthesis of a network with nonsimultaneous multicommodity flow requirements. In: Hansen P (ed). Studies on Graphs and Discrete Programming. North- Holland: Amsterdam, 269-277.
4. Gavish B et al (1989). Fiberoptic circuit network design under reliability constrains. IEEE J on Selected Areas in Commun 7: 1181-1187.
5. Dahl G and Stoer M (1998). A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Jon Comput 10: 1-11.
6. Stoer M and Dahl G (1994). A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68: 149-167.
7. Alevras D et al (1998). Survivable mobile phone network architectures: models and solution methods. IEEE Commun Magaz 36: 88-93.
8. Alevras D, Grotschel M and WessAly R (1996). Dimensioning of Survivable Telecommunications Networks. Technical Report SC-96-49, Konrad-Zuse-Zentrum, Berlin.
9. Amiri A and Pirkul H (1997). New formulation and relaxation to solve a concave-cost network flow problem. J Opl Res Soc 48: 278-287.
10. Held M, Wolfe P and Crowder H (1974). Validation of subgradient optimization. Mathe Program 6: 62-88.