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 条

[1] Strong inequalities for capacitated survivable network design problems
Bienstock, D
Muratore, G
MATHEMATICAL PROGRAMMING, 2000, 89 (01) : 127 - 147
[2] Partition inequalities for capacitated survivable network design based on directed p-cycles
Atamturk, Alper
Rajan, Deepak
DISCRETE OPTIMIZATION, 2008, 5 (02) : 415 - 433
[3] Survivable network design: the capacitated minimum spanning network problem
Jothi, R
Raghavachari, B
INFORMATION PROCESSING LETTERS, 2004, 91 (04) : 183 - 190
[4] An Approach to Solving the Survivable Capacitated Network Design Problem
Sridhar, Varadharajan
Park, June Sung
INTERNATIONAL JOURNAL OF BUSINESS DATA COMMUNICATIONS AND NETWORKING, 2005, 1 (02) : 1 - 16
[5] Solving survivable two-layer network design problems by metric inequalities
Mattia, Sara
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 51 (02) : 809 - 834
[6] Solving survivable two-layer network design problems by metric inequalities
Sara Mattia
Computational Optimization and Applications, 2012, 51 : 809 - 834
[7] Survivable capacitated network design problem:: new formulation and Lagrangean relaxation
Ríos, M
Marianov, V
Gutierrez, M
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (05) : 574 - 582
[8] Survivable Network Design Problems in Wireless Networks
Panigrahi, Debmalya
PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1014 - 1027
[9] Design of capacitated survivable networks with a single facility
Kerivin, H
Nace, D
Pham, TTL
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (02) : 248 - 261
[10] Capacitated facility location/network design problems
Melkote, S
Daskin, MS
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 129 (03) : 481 - 495

← 1 2 3 4 5 →