Computational issues for accessibility in discrete event simulation

DOI10.1145/229493.229509MaRDI QIDQ4575328zbMATH OpenOpenAlexFDO

Authors Enver Yücesan, Sheldon H. Jacobson

Publication date 13 July 2018

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/229493.229509

zbMATH Keywords

computational complexitylocal optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Intractability results in discrete-event simulation
• scientific article; zbMATH DE number 1380622
• On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
• scientific article; zbMATH DE number 1638973
• Optimization for simulation: theory vs. practice

Cited in

(3)

• A class of convergent generalized hill climbing algorithms
• On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
• Intractability results in discrete-event simulation

This page was built for publication: Computational issues for accessibility in discrete event simulation

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