Neural and delay based heuristics for the Steiner problem in networks

DOI10.1016/S0377-2217(97)00369-XMaRDI QIDQ1296029zbMATH OpenWikidataFDO

Authors Anoop Ghanwani

Publication date 1 April 2001

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

zbMATH Keywords

optimizationneural networksSteiner treesATM networksmultipoint routingconstrained Steiner treesmulticase communicationrandom neural network model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15)

Recommendations

• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• scientific article; zbMATH DE number 1304096
• A multicast routing algorithm based on tabu search
• SOFSEM 2005: Theory and Practice of Computer Science
• A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

Cites work

• scientific article; zbMATH DE number 51422 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A fast algorithm for Steiner trees
• A note on two problems in connexion with graphs
• A practical version of Lee's multicast switch architecture
• Algorithms for finding paths with multiple constraints
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
• Finding the K Shortest Loopless Paths in a Network
• Heuristics for the Steiner problem in graphs
• Routing to Multiple Destinations in Computer Networks
• Steiner Minimal Trees
• Steiner's problem in graphs and its implications
• The Complexity of Computing Steiner Minimal Trees
• The Steiner tree problem
• The computation of nearly minimal Steiner trees in graphs
• The steiner problem in graphs

Cited in

(7)

• A multicast routing algorithm based on tabu search
• \(G\)-networks: A versatile approach for work removal in queueing networks
• scientific article; zbMATH DE number 2080522 (Why is no real title available?)
• Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
• SOFSEM 2005: Theory and Practice of Computer Science
• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• A branch-and-cut algorithm for the Steiner tree problem with delays

This page was built for publication: Neural and delay based heuristics for the Steiner problem in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296029)