scientific article; zbMATH DE number 4156212

MaRDI QIDQ3484640zbMATH OpenFDO

Authors Alexander Martin

Publication date 1990

zbMATH Keywords

connected graphcutting plane algorithmedge weightsfacet defining inequalitiespolynomial timeseparation algorithmsSteiner-tree problem

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Packing Steiner Trees: Separation Algorithms
• The Steiner tree polytope and related polyhedra
• The Steiner tree problem. II: Properties and classes of facets
• On the Steiner 2-edge connected subgraph polytope
• Separating a superclass of comb inequalities in planar graphs

Cited in

(8)

• Separating from the dominant of the spanning tree polytope
• Packing Steiner trees: Further facets
• Chvátal-Gomory cuts for the Steiner tree problem
• Separation of partition inequalities
• Packing Steiner Trees: Separation Algorithms
• Practical Partitioning-Based Methods for the Steiner Problem
• The line connectivity problem
• Steiner trees and polyhedra

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484640)