Binary Steiner trees: structural results and an exact solution approach
type: Item
instance of: scholarly article
title: Binary Steiner trees: structural results and an exact solution approach
zbMATH Open document ID: 1387.90141
author: F. Liers
author: Alexander Martin
author: Susanne Pape
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 6872090
zbMATH Keywords: Steiner tree
zbMATH Keywords: degree constraint
zbMATH Keywords: Steiner ratio
zbMATH Keywords: integer programming
zbMATH Keywords: polytope
zbMATH Keywords: branch-\&-cut
describes a project that uses: SCIP
describes a project that uses: SCIP-Jack
describes a project that uses: SteinLib
describes a project that uses: DIMACS
describes a project that uses: Balibase
describes a project that uses: MrBayes
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.05.006
OpenAlex ID: W2469753241
cites work: Q3210200
cites work: The steiner problem in graphs
cites work: Q3874241
cites work: The computation of nearly minimal Steiner trees in graphs
cites work: Q3760270
cites work: A catalog of steiner tree formulations
cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
cites work: The Steiner tree problem. II: Properties and classes of facets
cites work: The Steiner tree polytope and related polyhedra
cites work: A branch and cut algorithm for the Steiner problem in graphs
cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Steiner problem in networks: A survey
cites work: The Steiner tree problem
cites work: Q5689037
cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: A branch and cut method for the degree-constrained minimum spanning tree problem
cites work: On some network design problems with degree constraints
cites work: Improved Algorithm for Degree Bounded Survivable Network Design Problem
cites work: Survivable Network Design with Degree or Order Constraints
cites work: Additive Guarantees for Degree-Bounded Directed Network Design
cites work: Q5302101
cites work: Approximation algorithms for degree-constrained minimum-cost network-design problems
cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal
cites work: Q4484920
cites work: The Steiner problem in phylogeny is NP-complete
cites work: Shortest connectivity. An introduction with applications in phylogeny.
cites work: Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
cites work: Low-Degree Spanning Trees of Small Weight
cites work: Many birds with one stone
cites work: Steiner Minimal Trees
cites work: Q3425132
cites work: A comparison of Steiner tree relaxations
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Odd Minimum Cut Sets and b-Matchings Revisited
cites work: Q4398361
cites work: Q4355916
cites work: SCIP: solving constraint integer programs
cites work: Q4763403
cites work: Graph theory applications
cites work: Benchmarking optimization software with performance profiles.
cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
DOI: 10.1016/J.DISOPT.2016.05.006
description: scientific article; zbMATH DE number 6872090