The dynamic predicate stashing copy problem and the Steiner problem in graphs

DOI10.1016/S0377-2217(99)00223-4zbMath0967.90015OpenAlexW2055902343MaRDI QIDQ1582038

S. Marsman, A. Volgenant, Cees W. Duin

Publication date: 3 September 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00223-4

zbMATH Keywords

communicationnetwork programmingSteiner problem in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• An edge elimination test for the Steiner problem in graphs
• The Steiner tree problem
• A characterization of the minimum cycle mean in a digraph
• Managing Redundancy in Distributed Computer Networks: A State Transition Graph Approach for the Stashing Problem
• Reduction tests for the steiner problem in grapsh
• The dynamic predicate stashing copy problem
• Solving Steiner tree problems in graphs to optimality
• Steiner's problem in graphs and its implications
• The steiner problem in graphs

This page was built for publication: The dynamic predicate stashing copy problem and the Steiner problem in graphs