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

Mathematical Programming Computation - Germany
doi 10.1007/s12532-016-0102-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

1988English

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

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

Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs

Physical Review E
2012English

Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

Separator-Based Pruned Dynamic Programming for Steiner Tree

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

An LP-based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy