scientific article; zbMATH DE number 3978858

MaRDI QIDQ3743142zbMATH OpenFDO

Authors Christina Schiemangk

Publication date 1986

zbMATH Keywords

Boltzmann distributionNP-complete subgraph optimizationsimulated annealingSteiner tree problemstochastic optimization algorithmthermodynamically motivated strategies

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• scientific article; zbMATH DE number 3917752
• scientific article; zbMATH DE number 3970752
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimal subgraph structures in scale-free configuration models
• Using simulated annealing to construct extremal graphs
• \textit{Physarum}-inspired applications in graph-optimization problems
• A simulated annealing algorithm for the maximum planar subgraph problem
• scientific article; zbMATH DE number 49060

Cited in

(5)

• scientific article; zbMATH DE number 3917751 (Why is no real title available?)
• scientific article; zbMATH DE number 3917752 (Why is no real title available?)
• scientific article; zbMATH DE number 3967815 (Why is no real title available?)
• scientific article; zbMATH DE number 3970752 (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 Q3743142)