Convergence of a simulation method for solution of combinatorial optimization problems

DOI10.1007/BF01130083MaRDI QIDQ1895067zbMATH OpenFDO

Authors L. B. Koshlaj, L. F. Gulyanitskii, I. V. Sergienko

Publication date 6 August 1995

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01130083

zbMATH Keywords

discrete optimizationprobabilistic simulation methodprobability mechanisms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4207226
• Simulated annealing methods with general acceptance probabilities
• The sample average approximation method for stochastic discrete optimization
• Simulation-based optimization using simulated annealing with ranking and selection
• A Method for Discrete Stochastic Optimization

Cites work

• Extension of not everywhere defined functions of many-valued logic
• scientific article; zbMATH DE number 4181414 (Why is no real title available?)
• scientific article; zbMATH DE number 59352 (Why is no real title available?)
• Maximal local classes of partial functions of infinite-valued logic
• The algebras of partial functions and their invariants
• The Galois connection between partial operations and relations
• Une généralisation de la notion de corps
• Universal algebras with all operations of bounded range

Cited in

(2)

• scientific article; zbMATH DE number 1961527 (Why is no real title available?)
• scientific article; zbMATH DE number 5220567 (Why is no real title available?)

This page was built for publication: Convergence of a simulation method for solution of combinatorial optimization problems

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