scientific article; zbMATH DE number 3917752

MaRDI QIDQ3692906zbMATH OpenFDO

Authors Christina Schiemangk

Publication date 1985

zbMATH Keywords

computer aided designevolutionideal gasesNP-complete subgraph optimization problemsstochastic optimization algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Statistical thermodynamics (82B30) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 3978858
• scientific article; zbMATH DE number 3970752
• A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
• Optimization by simulated annealing
• An SST-based algorithm for the steiner problem in graphs

Cited in

(6)

• Path-distance heuristic for the Steiner problem in undirected networks
• Steiner's problem in graphs: Heuristic methods
• Phase transitions of route patterns in the Steiner's problem with four cities
• scientific article; zbMATH DE number 3970752 (Why is no real title available?)
• scientific article; zbMATH DE number 3978858 (Why is no real title available?)
• A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks

This page was built for publication:

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