Separation of partition inequalities for the \((1,2)\)-survivable network design problem
type: Item
instance of: scholarly article
title: Separation of partition inequalities for the \((1,2)\)-survivable network design problem
zbMATH Open document ID: 1049.90010
DOI: 10.1016/S0167-6377(02)00182-7
published in: Operations Research Letters
publication date: 2003-04-03T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1892203
zbMATH Keywords: Survivable network
zbMATH Keywords: Partition inequalities
zbMATH Keywords: submodular function
zbMATH Keywords: separation
zbMATH Keywords: algorithm
author: Hervé L. M. Kerivin
author: A. R. Mahjoub
MaRDI profile type: Publication
cites work: Separation of partition inequalities
cites work: Separating from the dominant of the spanning tree polytope
cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
cites work: Optimal attack and reinforcement of a network
cites work: Q4263710
cites work: Submodular functions and optimization
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Q4845372
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Q3682236
cites work: Q4886038
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Design of survivable networks
description: scientific article; zbMATH DE number 1892203