scientific article; zbMATH DE number 4156212

zbMATH Open0704.90077MaRDI QIDQ3484640FDOQ3484640

Authors: Alexander Martin 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

connected graphpolynomial timecutting plane algorithmseparation algorithmsfacet defining inequalitiesedge weightsSteiner-tree problem

Mathematics Subject Classification ID

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

Cited In (7)

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

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)