Neural and delay based heuristics for the Steiner problem in networks

DOI10.1016/S0377-2217(97)00369-XzbMath0957.90025WikidataQ126436855 ScholiaQ126436855MaRDI QIDQ1296029

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

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

Related Items (2)

A branch-and-cut algorithm for the Steiner tree problem with delays ⋮ \(G\)-networks: A versatile approach for work removal in queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A fast algorithm for Steiner trees
• Heuristics for the Steiner problem in graphs
• The Steiner tree problem
• Algorithms for finding paths with multiple constraints
• The Complexity of Computing Steiner Minimal Trees
• A practical version of Lee's multicast switch architecture
• Routing to Multiple Destinations in Computer Networks
• The computation of nearly minimal Steiner trees in graphs
• Steiner Minimal Trees
• Finding the K Shortest Loopless Paths in a Network
• Steiner's problem in graphs and its implications
• The steiner problem in graphs
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity

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