Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms

doi 10.21236/ada199769

Full Text

Abstract

Available in

Date

Authors

Publisher

Defense Technical Information Center

Related search

A Node-Based Layered Graph Approach for the Steiner Tree Problem With Revenues, Budget and Hop-Constraints

Mathematical Programming Computation
Theoretical Computer ScienceSoftware
2016English

New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2019English

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

The Steiner Tree Reoptimization Problem With Sharpened Triangle Inequality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Average Covering Tree Value for Directed Graph Games

SSRN Electronic Journal
2012English

Steiner Minimal Tree for Points on a Circle

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Group, Graphs, Algorithms: The Graph Isomorphism Problem

2019English

On the Covering Steiner Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy