Combinatorial optimization by stochastic automata

DOI10.1007/BF02023058zbMath0713.90066MaRDI QIDQ750309

Eugene Shragowitz, Rung-Bin Lin

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingS-type GH-stochastic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Nonstationary Markov chains and convergence of the annealing algorithm
• Intersection theorems in permutation groups
• Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence and finite-time behavior of simulated annealing
• Simulated annealing methods with general acceptance probabilities
• Some Metrical Problems on Sn
• Learning Automata - A Survey
• Discrete Optimizing
• Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
• Absolutely Expedient Learning Algorithms for Stochastic Automata

This page was built for publication: Combinatorial optimization by stochastic automata