The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
From MaRDI portal
Publication:1330902
DOI10.1007/BF01582573zbMATH Open0821.90124OpenAlexW1974745840MaRDI QIDQ1330902FDOQ1330902
Authors: V. Pereyra 
Publication date: 10 August 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582573
Recommendations
- The Steiner tree problem. II: Properties and classes of facets
- scientific article; zbMATH DE number 1182759
- A catalog of steiner tree formulations
- Solving Steiner trees: Recent advances, challenges, and perspectives
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
- The Steiner tree problem on graphs: inapproximability results
- scientific article; zbMATH DE number 1834686
- Solving rectilinear Steiner tree problems exactly in theory and practice
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- scientific article; zbMATH DE number 3918122
Programming involving graphs or networks (90C35) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Title not available (Why is that?)
- The traveling salesman problem on a graph and some related integer polyhedra
- Title not available (Why is that?)
- Steiner trees, partial 2–trees, and minimum IFI networks
- Blocking and anti-blocking pairs of polyhedra
- Steiner problem in networks: A survey
- A dual ascent approach for steiner tree problems on a directed graph
- Steiner trees, connected domination and strongly chordal graphs
- The perfectly matchable subgraph polytope of a bipartite graph
- The steiner problem in graphs
- Steiner's problem in graphs and its implications
- On the spanning tree polyhedron
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- On Steiner Minimal Trees with Rectilinear Distance
- An integer linear programming approach to the steiner problem in graphs
- Rectilinear steiner trees: Efficient special-case algorithms
Cited In (57)
- Towards a lifecycle oriented design of infrastructure by mathematical optimization
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem
- Idealness and 2-resistant sets
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Discrete relaxations of combinatorial programs
- Stronger MIP formulations for the Steiner forest problem
- Lehman's theorem and the directed Steiner tree problem
- Chvátal-Gomory cuts for the Steiner tree problem
- Opposite elements in clutters
- Binary Steiner trees: structural results and an exact solution approach
- Optimal capacitated ring trees
- Title not available (Why is that?)
- Vertex covering with capacitated trees
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- Optimal relay node placement in delay constrained wireless sensor network design
- A note on the generalized Steiner tree polytope
- Optimizing the Design of a Wind Farm Collection Network
- A lower bound for the steiner tree problem in directed graphs
- MIP models for connected facility location: a theoretical and computational study
- Intermediate integer programming representations using value disjunctions
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Some formulations for the group Steiner tree problem
- Approaches to the Steiner Problem in Networks
- Distance transformation for network design problems
- Graphs and algorithms in communication networks on seven league boots
- Optimal Steiner trees under node and edge privacy conflicts
- Facets of two Steiner arborescence polyhedra
- Title not available (Why is that?)
- Polyhedral study of the connected subgraph problem
- A comparison of Steiner tree relaxations
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Solving Steiner trees: Recent advances, challenges, and perspectives
- A tabu search heuristic for the generalized minimum spanning tree problem
- Approximation of Steiner forest via the bidirected cut relaxation
- Steiner trees and polyhedra
- Title not available (Why is that?)
- A catalog of steiner tree formulations
- Using multiflow formulations to solve the Steiner tree problem in graphs
- Directed Steiner problems with connectivity constraints
- An Exact Algorithm for the Steiner Forest Problem
- A partition-based relaxation for Steiner trees
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Non delayed relax-and-cut algorithms
- Generalized network design problems.
- Dimensioning multicast-enabled communications networks
- The robust network loading problem with dynamic routing
- Towards optimizing the deployment of optical access networks
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- The Steiner Traveling Salesman Polytope and Related Polyhedra
- Coordinated cutting plane generation via multi-objective separation
- On survivable network polyhedra
- Exact approaches to the single-source network loading problem
- The Steiner connectivity problem
This page was built for publication: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330902)
