Thumbnail - Request a copy

Two edge connected spanning subgraphs and polyhedra

Mahjoub, Ali Ridha (1994), Two edge connected spanning subgraphs and polyhedra, Mathematical Programming, 64, 1-3, p. 199-208. http://dx.doi.org/10.1007/BF01582572

Type
Article accepté pour publication ou publié
Date
1994
Journal name
Mathematical Programming
Volume
64
Number
1-3
Publisher
Springer
Pages
199-208
Publication identifier
Metadata
Show full item record
Author(s)
Mahjoub, Ali Ridha
Abstract (EN)
This paper studies the problem of finding a two-edge connected spanning subgraph of minimum weight. This problem is closely related to the widely studied traveling salesman problem and has applications to the design of reliable communication and transportation networks. We discuss the polytope associated with the solutions to this problem. We show that when the graph is series-parallel, the polytope is completely described by the trivial constraints and the so-called cut constraints. We also give some classes of facet defining inequalities of this polytope when the graph is general.
Subjects / Keywords
Series—parallel graphs; Facets; Polyhedra; Two-edge connected graphs