On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

DOI10.1287/OPRE.47.3.476MaRDI QIDQ4545686zbMATH OpenOpenAlexFDO

Authors Sheldon H. Jacobson, Enver Yücesan

Publication date 17 July 2003

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.47.3.476

zbMATH Keywords

computational complexity theoryvarious discrete event simulation problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Computational issues for accessibility in discrete event simulation
• Intractability results in discrete-event simulation
• Studying the complexity of global verification for NP-hard discrete optimization problems
• On the generality of event-graph models
• Computational Complexity of Network Reliability Analysis: An Overview

Cited in

(5)

• A class of convergent generalized hill climbing algorithms
• On the generality of event-graph models
• scientific article; zbMATH DE number 176358 (Why is no real title available?)
• Computational issues for accessibility in discrete event simulation
• Intractability results in discrete-event simulation

This page was built for publication: On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

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