Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:19, 30 December 2024

scientific article; zbMATH DE number 7775259

Language	Label	Description	Also known as
English	Solving Steiner trees: Recent advances, challenges, and perspectives	scientific article; zbMATH DE number 7775259

Statements

scholarly article

0 references

Solving Steiner trees: Recent advances, challenges, and perspectives (English)

0 references

0 references

0 references

publication date

11 December 2023

0 references

zbMATH Keywords

combinatorial optimization

0 references

exact methods

0 references

heuristics

0 references

integer programming

0 references

Steiner tree problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.22005

0 references

The Maximum Weight Connected Subgraph Problem

0 references

The Rooted Maximum Node-Weight Connected Subgraph Problem

0 references

Exact approaches for solving robust prize-collecting Steiner tree problems

0 references

A relax-and-cut framework for large-scale maximum weight connected subgraph problems

0 references

An integer linear programming approach to the steiner problem in graphs

0 references

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

0 references

The incremental connected facility location problem

0 references

An approach for solving singular two point boundary value problems: analytical and numerical treatment

0 references

Solving Steiner tree problems in graphs with Lagrangian relaxation

0 references

Computational methods in systems biology. 7th international conference, CMSB 2009, Bologna, Italy, August 31--September 1, 2009. Proceedings

0 references

The prize collecting traveling salesman problem

0 references

Dual-Based Local Search for the Connected Facility Location and Related Problems

0 references

Approximate robust optimization for the connected facility location problem

0 references

An inexact sample average approximation approach for the stochastic connected facility location problem

0 references

0 references

An algorithm for the steiner problem in graphs

0 references

An SST-based algorithm for the steiner problem in graphs

0 references

The Steiner problem with edge lengths 1 and 2

0 references

The Influence of Preprocessing on Steiner Tree Approximations

0 references

Strong Steiner Tree Approximations in Practice

0 references

A note on the prize collecting traveling salesman problem

0 references

Steiner trees and polyhedra

0 references

Fourier meets M\"{o}bius: fast subset convolution

0 references

Lagrangian decompositions for the two-level FTTx network design problem

0 references

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

0 references

0 references

On the history of the Euclidean Steiner tree problem

0 references

Optimal interconnection trees in the plane. Theory, algorithms and applications

0 references

Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph

0 references

Steiner Tree Approximation via Iterative Randomized Rounding

0 references

Worst-case performance of Wong's Steiner tree heuristic

0 references

A Heuristic Method for the Set Covering Problem

0 references

Imposing Connectivity Constraints in Forest Planning Models

0 references

Hypergraphic LP Relaxations for Steiner Trees

0 references

Approximation Algorithms for Directed Steiner Problems

0 references

The regenerator location problem

0 references

Obtaining optimal <i>k</i> -cardinality trees fast

0 references

Improved Steiner tree algorithms for bounded treewidth

0 references

Contraction-Based Steiner Tree Approximations in Practice

0 references

The Steiner tree problem on graphs: inapproximability results

0 references

Solving the Steiner Tree Problem on a Graph Using Branch and Cut

0 references

The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets

0 references

The Steiner tree problem. II: Properties and classes of facets

0 references

Wildlife corridors as a connected subgraph problem

0 references

Connections in Networks: Hardness of Feasibility Versus Optimality

0 references

An exact algorithm for the node weighted Steiner tree problem

0 references

Steiner Tree Problems With Profits

0 references

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

0 references

Solving Connected Subgraph Problems in Wildlife Conservation

0 references

The steiner problem in graphs

0 references

Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms

0 references

A distributed dual ascent algorithm for Steiner problems in multicast routing

0 references

Advances in Steiner trees

0 references

0 references

Some generalizations of the steiner problem in graphs

0 references

Reduction tests for the steiner problem in grapsh

0 references

Solving group Steiner problems as Steiner problems.

0 references

Efficient path and vertex exchange in steiner tree algorithms

0 references

0 references

A strong lower bound for the Node Weighted Steiner Tree Problem

0 references

Send-and-Split Method for Minimum-Concave-Cost Network Flows

0 references

Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm

0 references

Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions

0 references

Insight into the computation of Steiner minimal trees in Euclidean space of general dimension

0 references

Sharing the cost of multicast transmissions

0 references

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

0 references

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

0 references

Minimal spanning trees with a constraint on the number of leaves

0 references

Stronger path‐based extended formulation for the Steiner tree problem

0 references

Facets of two Steiner arborescence polyhedra

0 references

Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure

0 references

Thinning out Steiner trees: a node-based model for uniform edge costs

0 references

Local branching

0 references

Swap-vertex based neighborhood for Steiner tree problems

0 references

Dynamic programming for minimum Steiner trees

0 references

The maximum-leaf spanning tree problem: Formulations and facets

0 references

SCIP-Jack -- a solver for STP and variants with parallelization extensions

0 references

A tabu search heuristic for the Steiner Tree Problem

0 references

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

0 references

Arborescence polytopes for series-parallel graphs

0 references

The Steiner tree polytope and related polyhedra

0 references

A catalog of steiner tree formulations

0 references

Matroids and integrality gaps for hypergraphic steiner tree relaxations

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

A cutting plane algorithm for the capacitated connected facility location problem

0 references

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

0 references

MIP models for connected facility location: a theoretical and computational study

0 references

Hop constrained Steiner trees with multiple root nodes

0 references

Layered graph approaches for combinatorial optimization problems

0 references

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

0 references

The multi-weighted Steiner tree problem: A reformulation by intersection

0 references

Towards optimizing the deployment of optical access networks

0 references

Steiner's problem in graphs and its implications

0 references

Polylogarithmic inapproximability

0 references

The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches

0 references

A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem

0 references

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm

0 references

Steiner tree problems

0 references

The Steiner tree problem

0 references

0 references

The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study

0 references

Solving the Graphical Steiner Tree Problem Using Genetic Algorithms

0 references

Reducibility among Combinatorial Problems

0 references

New approximation algorithms for the Steiner tree problems

0 references

Algorithms - ESA 2003

0 references

Solving Steiner tree problems in graphs to optimality

0 references

A partition-based relaxation for Steiner trees

0 references

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem

0 references

The connected facility location polytope

0 references

Decomposition methods for the two-stage stochastic Steiner tree problem

0 references

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

0 references

An algorithmic framework for the exact solution of tree-star problems

0 references

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design

0 references

0 references

A lower bound for the steiner tree problem in directed graphs

0 references

A MIP-based approach to solve the prize-collecting local access network design problem

0 references

An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem

0 references

Non delayed relax-and-cut algorithms

0 references

A branch and cut algorithm for the Steiner problem in graphs

0 references

Reformulations and solution algorithms for the maximum leaf spanning tree problem

0 references

0 references

0 references

Tree polytope on 2-trees

0 references

A faster approximation algorithm for the Steiner problem in graphs

0 references

The \(p\)-arborescence star problem: formulations and exact solution approaches

0 references

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

0 references

A note on distributed multicast routing in point-to-point networks

0 references

A survey of combinatorial optimization problems in multicast routing

0 references

Optimal Selection of a Connected Reserve Network

0 references

A graph theory approach for designing conservation reserve networks with minimal fragmentation

0 references

A robust and scalable algorithm for the Steiner problem in graphs

0 references

0 references

0 references

0 references

A comparison of Steiner tree relaxations

0 references

Improved algorithms for the Steiner problem in networks

0 references

0 references

On Steiner trees and minimum spanning trees in hypergraphs

0 references

Practical Partitioning-Based Methods for the Steiner Problem

0 references

Approaches to the Steiner Problem in Networks

0 references

Computational Science - ICCS 2004

0 references

Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems

0 references

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

0 references

0 references

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

0 references

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem

0 references

0 references

0 references

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

0 references

Tighter Bounds for Graph Steiner Tree Approximation

0 references

A constrained Steiner tree problem

0 references

A note on the generalized Steiner tree polytope

0 references

A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem

0 references

The node-weighted steiner tree problem

0 references

A linear programming based approach to the Steiner tree problem with a fixed number of terminals

0 references

Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem

0 references

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

0 references

0 references

Reduction tests for the prize-collecting Steiner problem

0 references

Preprocessing Steiner problems from VLSI layout

0 references

Fast Local Search for Steiner Trees in Graphs

0 references

Fast local search for the steiner problem in graphs

0 references

Parallel local search for Steiner trees in graphs

0 references

Steiner's problem in graphs: Heuristic methods

0 references

0 references

Faster algorithm for optimum Steiner trees

0 references

Steiner problem in networks: A survey

0 references

Reductions for the rectilinear steiner tree problem

0 references

Euclidean Steiner minimum trees: An improved exact algorithm

0 references

0 references

A dual ascent approach for steiner tree problems on a directed graph

0 references

Restricted swap-based neighborhood search for the minimum connected dominating set problem

0 references

Rectilinear group Steiner trees and applications in VLSI design

0 references

An 11/6-approximation algorithm for the network Steiner problem

0 references

A faster approximation algorithm for the Steiner tree problem in graphs

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1002/NET.22005

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6087073

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6087073&oldid=39692548"