A cutting plane algorithm for computing \(k\)-edge survivability of a network
type: Item
instance of: scholarly article
title: A cutting plane algorithm for computing \(k\)-edge survivability of a network
zbMATH Open document ID: 1056.90015
DOI: 10.1016/S0377-2217(03)00135-8
author: Y. S. Myung
author: Hyunjoon Kim
published in: European Journal of Operational Research
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2093025
zbMATH Keywords: Integer programming
zbMATH Keywords: Network survivability
zbMATH Keywords: Polyhedral
zbMATH Keywords: analysis
zbMATH Keywords: Cutting plane algorithm
describes a project that uses: SONET
MaRDI profile type: Publication
cites work: Q4035361
cites work: Q4845372
cites work: Multi-Commodity Network Flows
cites work: Design of Communication Networks with Survivability Constraints
cites work: Q3999466
cites work: Deterministic network interdiction
full work available at URL: s0377-2217(03)00135-8
OpenAlex ID: W2034304357
description: scientific article; zbMATH DE number 2093025