ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

Two-edge connected spanning subgraphs and polyhedra (1994)

Mahjoub, Ali Ridha

Springer

Mathematical programming 64 (1994), S. 199-208

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1436-4646

Schlagwort(e): Two-edge connected graphs ; Polyhedra ; Facets ; Series—parallel graphs

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract 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.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01582572

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer