Strong inequalities for capacitated survivable network design problems

被引：0
|
作者：
Daniel Bienstock
Gabriella Muratore
机构：
[1] Columbia University,
[2] New York,undefined
[3] NY 10027,undefined
来源：
Mathematical Programming | 2000年 / 89卷
关键词：
Mathematics Subject Classification (1991): 90C11, 68M10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present several classes of facet-defining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex- or edge-deletion at least some prescribed fraction of each demand can be routed.
引用
下载
收藏
页码：127 / 147
页数：20
相关论文
共 50 条
  • [21] A tabu search for the design of capacitated rooted survivable planar networks
    Alain Hertz
    Thomas Ridremont
    Journal of Heuristics, 2020, 26 : 829 - 850
  • [22] A branch-and-cut algorithm for capacitated network design problems
    Günlük, O
    MATHEMATICAL PROGRAMMING, 1999, 86 (01) : 17 - 39
  • [23] A branch-and-cut algorithm for capacitated network design problems
    Oktay Günlük
    Mathematical Programming, 1999, 86 : 17 - 39
  • [24] Strengthening integrality gaps for capacitated network design and covering problems
    Carr, RD
    Fleischer, LK
    Leung, VJ
    Phillips, CA
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 106 - 115
  • [25] Convex hull of two core capacitated network design problems
    Magnanti, T.L.
    Mirchandani, P.
    Vachani, R.
    Mathematical Programming, 1993, 60 (02):
  • [26] A tabu search for the design of capacitated rooted survivable planar networks
    Hertz, Alain
    Ridremont, Thomas
    JOURNAL OF HEURISTICS, 2020, 26 (06) : 829 - 850
  • [27] A directed cycle-based column-and-cut generation method for capacitated survivable network design
    Rajan, D
    Atamtürk, A
    NETWORKS, 2004, 43 (04) : 201 - 211
  • [28] Approximation algorithms for survivable multicommodity flow problems with applications to network design
    Todimala, Ajay
    Ramamurthy, Byrav
    25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 132 - 143
  • [29] Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems
    Han, Lu
    Chau, Vincent
    Fong, Chi Kit Ken
    FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022, 2022, 13461 : 219 - 232
  • [30] Survivable Network Design and Optimization with Network Families
    Todd, Brody
    Ibigbami, Abiose
    Doucette, John
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2014, 2014
12345